#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100005;
const int MAXK = 202;
int n, k ,a[MAXN], p[MAXN];
ll dp[2][MAXN];
int tr[MAXK][MAXN];
void chmx (int &x, int y) {
x = x > y ? x : y;
}
void tran (int i, int j, int l) {
ll nw = dp[(l&1)^1][j] + 1LL * (p[i] - p[j]) * p[j];
if (dp[l&1][i] <= nw) {
tr[l][i] = j;
dp[l&1][i] = nw;
}
}
void solve (int nL, int nR, int tL, int tR, int kd) {
if (nL > nR) {
return;
}
if (tL == tR) {
for (int i=nL; i<=nR; i++) {
tran(i, tL, kd);
}
} else {
int nM = (nL + nR) >> 1;
for (int i=tL; i<=min(tR, nM-1); i++) {
tran(nM, i, kd);
}
solve(nL, nM-1, tL, tr[kd][nM], kd);
solve(nM+1, nR, tr[kd][nM], tR, kd);
}
}
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i=1; i<=n; i++) {
cin >> a[i];
p[i] = a[i] + p[i-1];
}
for (int i=1; i<=k; i++) {
solve(1, n, 0, n, i);
}
cout << dp[k&1][n] << endl;
for (int i=k; i>=1; i--) {
cout << tr[i][n] << " \n"[i==1];
n = tr[i][n];
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
692 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
77 ms |
9336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
60 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
53 ms |
6776 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
73 ms |
7160 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
52 ms |
6008 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
64 ms |
6776 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
74 ms |
8568 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
4088 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
29 ms |
4096 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
772 ms |
81528 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
32 ms |
4344 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1072 ms |
81272 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
558 ms |
57720 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
763 ms |
62016 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
557 ms |
50936 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
598 ms |
57976 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
769 ms |
73592 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
