#include <bits/stdc++.h>
using namespace std;
int n, K;
int S[100005];
int which[205][100005];
long long DP[2][100005];
long long *Last, *Now;
void divide(int k, int L, int R, int whL, int whR){
int mid = (L + R) >> 1;
for(int j = whL; j <= whR && j <= mid ; ++j){
long long aux = Last[j - 1] + 1LL * (S[mid] - S[j - 1]) * (S[n] - S[mid]);
if(aux > Now[mid]) Now[mid] = aux, which[k][mid] = j;
}
if(L < R){
divide(k, L, mid - 1, whL, which[k][mid]);
divide(k, mid + 1, R, which[k][mid], whR);
}
}
void solve(int n, int k){
if(k == 1) return ;
solve(which[k][n] - 1, k - 1);
printf("%d ", which[k][n] - 1);
}
int main()
{
// freopen("sequence.in", "r", stdin);
// freopen("sequence.out", "w", stdout);
scanf("%d%d", &n, &K);
for(int i = 1; i <= n ; ++i) scanf("%d", &S[i]), S[i] += S[i - 1];
for(int i = 1; i <= n ; ++i) DP[1][i] = 1LL * S[i] * (S[n] - S[i]);
for(int k = 2; k <= K + 1 ; ++k){
Last = DP[!(k & 1)], Now = DP[k & 1];
for(int i = 1; i <= n ; ++i) Now[i] = -1, which[k][i] = -1;
divide(k, k, n, k, n);
}
printf("%lld\n", DP[!(K & 1)][n]);
solve(n, K + 1);
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &K);
~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:35:52: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int i = 1; i <= n ; ++i) scanf("%d", &S[i]), S[i] += S[i - 1];
~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
356 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
640 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
640 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
65 ms |
9312 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
640 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
76 ms |
5840 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
73 ms |
6668 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
67 ms |
7160 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
5880 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
66 ms |
6648 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
82 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
3448 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
3504 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
682 ms |
80724 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
22 ms |
4088 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1388 ms |
80888 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
844 ms |
57292 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
720 ms |
61560 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
512 ms |
50496 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
701 ms |
57340 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
899 ms |
73080 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
