#include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1000 + 5, K = 205;
const long long inf = 1e18 + N;
int n, k;
int a[N];
long long dp[N][K];
long long ps[N];
int par[N][K];
vector <int> vec;
long long get(int lv, int x, int y) {
return 1ll * (ps[x] - ps[y]) * (ps[x] - ps[y]) + dp[y][lv - 1];
}
void solve(int lv, int l, int r, int s, int e) {
if (r <= l) {
return;
}
int md = (l + r) / 2;
for (int i = s; i <= e; i++) {
if (get(lv, md, i) < dp[md][lv]) {
par[md][lv] = i;
dp[md][lv] = get(lv, md, i);
}
}
solve(lv, l, md, s, par[md][lv]);
solve(lv, md + 1, r, par[md][lv], e);
}
int main() {
cin >> n >> k;
k++;
for (int i = 1; i <= n; i++) {
cin >> a[i];
ps[i] = ps[i - 1] + a[i];
for (int j = 0; j <= k; j++) {
dp[i][j] = inf;
}
}
for (int j = 1; j <= k; j++) {
solve(j, 1, n + 1, 0, n);
// for (int i = 1; i <= n; i++) {
// cout << "73 " << i << " " << j << " " << dp[i][j] << endl;
// }
}
cout << (1ll * ps[n] * ps[n] - dp[n][k]) / 2 << '\n';
int v = n;
for (int j = k; j > 0; j--) {
v = par[v][j];
if (v) {
vec.push_back(v);
}
}
sort(vec.begin(), vec.end());
for (auto x : vec) {
cout << x << " ";
}
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 |
Incorrect |
1 ms |
364 KB |
Unexpected end of file - int32 expected |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
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 |
620 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
620 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 |
2 ms |
876 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
2 ms |
876 KB |
Unexpected end of file - int32 expected |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 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 |
10 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 |
13 ms |
2796 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
2796 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
2816 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 |
20 ms |
24684 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
21 ms |
24556 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
158 ms |
24684 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
23 ms |
24556 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
129 ms |
24556 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
128 ms |
24556 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
126 ms |
24556 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
99 ms |
24684 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
156 ms |
24556 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
153 ms |
24684 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
84 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
