#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const int MAXN = (int)(1e5) + 5;
const int MAXK = 200+5;
int opt[MAXN][MAXK];
ll dp[MAXN][MAXK];
ll arr[MAXN];
ll prefSum[MAXN];
ll calc(int l, int r) {
if (l == 0) {
return dp[r][0];
}
else {
return dp[r][0] - (prefSum[r]-prefSum[l-1])*prefSum[l-1] - dp[l-1][0];
}
}
void recur(int k, int tl, int tr, int l, int r) {
if (tl > tr) {
return;
}
int tm = (tl + tr)/2;
ll best = (ll)(1e18);
int id = -1;
for (int i = min(r, tm-1); i >= l; i--) {
if (dp[i][k-1] + calc(i+1, tm) < best) {
best = dp[i][k-1] + calc(i+1, tm);
id = i;
}
}
opt[tm][k] = id;
dp[tm][k] = best;
recur(k, tl, tm-1, l, id);
recur(k, tm+1, tr, id, r);
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int N, K;
cin >> N >> K;
ll sm = 0;
FR(i, N) {
cin >> arr[i];
dp[i][0] = (i > 0 ? dp[i-1][0] : 0) + arr[i]*sm;
opt[i][0] = -1;
sm += arr[i];
prefSum[i] = sm;
}
for (int i = 1; i <= K; i++) {
recur(i, 0, N-1, 0, N-1);
}
cout << dp[N-1][0] - dp[N-1][K] << '\n';
int u = N-1;
for (int iter = K; iter >= 1; iter--) {
cout << opt[u][iter]+1 << '\n';
u = opt[u][iter];
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
2796 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
2796 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
2796 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
2796 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2796 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
2796 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
2796 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
24556 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
17 ms |
24556 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
140 ms |
24684 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
16 ms |
24684 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
122 ms |
24684 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
121 ms |
24556 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
120 ms |
24684 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
95 ms |
24684 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
115 ms |
24684 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
148 ms |
24684 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
70 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
