#include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 1e5 + 2;
int a[M], pre[M];
int dp[M][201];
int id[M][201];
const int inf = LLONG_MAX / 2;
int sq(int x) {
return x * x;
}
signed main() {
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
for(int i = 0; i <= k; i++) dp[0][i] = 0;
for(int i = 1; i <= n; i++) {
dp[i][1] = sq(pre[i]);
for(int j = 2; j <= k + 1; j++) {
dp[i][j] = inf;
for(int q = 1; q < i; q++) {
if(dp[i][j] > dp[q][j - 1] + sq(pre[i] - pre[q])) {
dp[i][j] = dp[q][j - 1] + sq(pre[i] - pre[q]);
id[i][j] = q;
}
}
}
}
cout << (sq(pre[n]) - dp[n][k + 1]) / 2 << '\n';
int gay = id[n][k + 1];
k++;
while(k > 1) {
cout << gay << ' ';
k--;
gay = id[gay][k];
}
cout << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
6748 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
6744 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
6748 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
6748 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
8 ms |
6744 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
6748 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
6748 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
6748 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8796 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
8796 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
111 ms |
8800 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
8792 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
122 ms |
8800 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
98 ms |
8784 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
119 ms |
8784 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
121 ms |
8816 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
25 ms |
8820 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
49 ms |
8792 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
423 ms |
37528 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
340 ms |
37528 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2051 ms |
17248 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2013 ms |
70412 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
