#include<bits/stdc++.h>
using namespace std;
int a[100100];
long long s[100100], dp[2][100100];
int mxk[200][100100];
void solve (int i, int l, int r, int kmin, int kmax, int I) {
if (r < l) return;
int mid = (l+r)/2, m = -1;
for (int k = kmin; k <= min(kmax, mid-1); k++) {
long long nw = dp[i^1][k] + (s[mid]-s[k])*(s[k]-s[0]);
if (nw >= dp[i][mid]) {
dp[i][mid] = nw;
m = k;
}
}
mxk[I][mid] = m;
solve(i, l, mid-1, kmin, m, I); solve(i, mid+1, r, m, kmax, I);
}
int main(){
int n, k; scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), s[i] = s[i-1]+a[i];
for (int i = 1; i <= k; i++) solve(i%2, 1, n, 1, n-1, i);
printf("%lld\n", dp[k%2][n]);
for (int i = k, x = n; i > 0; i--) printf("%d ", x = mxk[i][x]);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:23:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
23 | int n, k; scanf("%d %d", &n, &k);
| ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:24:39: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
24 | for (int i = 1; i <= n; i++) scanf("%d", &a[i]), s[i] = s[i-1]+a[i];
| ~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4540 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2504 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
20924 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
2396 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 |
2 ms |
10588 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
6492 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 |
6492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
13 ms |
78268 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
55644 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
12 ms |
72284 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
13 ms |
78428 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
18900 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
12636 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
22876 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
16 ms |
78452 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
17 ms |
78404 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
68188 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
17 ms |
78400 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
16 ms |
78348 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
16732 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
33116 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2648 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
2640 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
52 ms |
78680 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
45 ms |
47700 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
44 ms |
55892 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
55 ms |
60244 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
42 ms |
49980 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
43 ms |
56300 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
53 ms |
72560 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
5208 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
5384 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
442 ms |
81644 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
5724 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
679 ms |
81496 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
423 ms |
58964 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
513 ms |
63128 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
360 ms |
52724 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
351 ms |
58832 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
446 ms |
75332 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
