#include <iostream>
#define int long long
using namespace std;
const int MAX_N = 1e4;
const int MAX_K = 200;
const int INF = (1LL << 60);
int a[MAX_N + 1], sp[MAX_N + 1], dp[MAX_N + 1][MAX_K + 1];
int sol[MAX_N + 1][MAX_K + 1];
int n, k;
void divide(int k, int l, int r, int p, int q) {
if (p > q) {
return;
}
int mid = (p + q) / 2;
dp[mid][k] = -INF;
int best = 0;
for (int i = l; i <= min(mid, r); i++) {
int kek = (sp[mid] - sp[i - 1]) * (sp[n] - sp[mid]);
if (dp[i - 1][k - 1] + kek >= dp[mid][k]) {
dp[mid][k] = dp[i - 1][k - 1] + kek;
best = i;
}
}
sol[mid][k] = best - 1;
divide(k, l, best, p, mid - 1);
divide(k, best, r, mid + 1, q);
}
signed main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sp[i] = sp[i - 1] + a[i];
}
k++;
for (int i = 1; i <= n; i++) {
dp[i][1] = sp[i] * (sp[n] - sp[i]);
}
for (int i = 2; i <= k; i++) {
divide(i, 1, n, 1, n);
}
cout << dp[n][k] << "\n";
int aux = n;
for (int i = k; i >= 2; i--) {
cout << sol[aux][i] << " ";
aux = sol[aux][i];
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
312 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
312 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
308 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
440 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
440 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
372 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
852 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
1 ms |
952 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
852 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
3380 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
7 ms |
3412 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
9 ms |
3376 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
7 ms |
3412 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
3412 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
3496 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
3492 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
31828 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
16 ms |
31932 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
92 ms |
31960 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
16 ms |
31956 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
70 ms |
31936 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
69 ms |
31924 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
90 ms |
31968 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
63 ms |
31892 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
76 ms |
31896 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
88 ms |
31944 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
852 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |