-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1024.cpp
More file actions
56 lines (56 loc) · 1.32 KB
/
Copy path1024.cpp
File metadata and controls
56 lines (56 loc) · 1.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int M;
cin >> M;
for (int z = 0;z < M;z++)
{
int N;
cin >> N;
double p[550] = {};
double q[550] = {};
double e[550][550] = {};
double w[550][550] = {};
// 这题的答案和键值无关,所以不需要存键值
for (int i = 0;i < N;i++)
{
int temp;
cin >> temp;
}
for (int i = 1;i <= N;i++)
{
cin >> p[i];
}
double sum = 0.0;
for (int i = 0;i <= N;i++)
{
cin >> q[i];
sum += q[i];
}
for (int i = 1;i <= N + 1;i++)
{
e[i][i - 1] = q[i - 1];
w[i][i - 1] = q[i - 1];
}
for (int l = 1;l <= N;l++)
{
for (int i = 1;i <= N - l + 1;i++)
{
int j = i + l - 1;
e[i][j] = 999999.0;
w[i][j] = w[i][j - 1] + p[j] + q[j];
for (int r = i;r <= j;r++)
{
double t = e[i][r - 1] + e[r + 1][j] + w[i][j];
if (t < e[i][j])
{
e[i][j] = t;
}
}
}
}
printf("%.6f\n", e[1][N] - sum);
}
}