#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<ll> pref(n, 0);
partial_sum(a.begin(), a.end(), pref.begin());
ll dp[k + 1][n], parent[k + 1][n];
memset(dp, 0xff, sizeof(dp));
for (int j = 0; j < n; ++j) {
dp[0][j] = 0;
}
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
dp[i][j] = LLONG_MIN;
}
}
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < j; ++h) {
ll t = dp[i - 1][h] + pref[h] * (pref[j] - pref[h]);
if (t >= dp[i][j]) {
dp[i][j] = t;
parent[i][j] = h;
}
}
}
}
cout << dp[k][n - 1] << endl;
int u = n - 1;
for (int i = k; i > 0; --i) {
u = parent[i][u];
cout << (u + 1) << ' ';
}
cout << endl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
252 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
888 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
760 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
888 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
9 ms |
1016 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
17 ms |
404 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
504 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
143 ms |
3548 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
145 ms |
3576 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
128 ms |
3112 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
148 ms |
3448 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
147 ms |
3420 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
31 ms |
988 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
60 ms |
1628 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
203 ms |
1152 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
182 ms |
988 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2041 ms |
18584 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
2035 ms |
5168 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
