#include <iostream>
using namespace std;
const int N = 1e5 + 5, K = 205;
int64_t f[2][N], a[N];
int opt[K][N], s[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k; cin >> n >> k;
for (int i = 1; i <= n; ++i) cin >> a[i], a[i] += a[i - 1];
for (int l = 1; l <= k; ++l) {
auto c = [&](int j) { return f[(l & 1) ^ 1][j] - a[j] * a[j]; };
auto val = [&](int j, int x) { return a[j] * x + c(j); };
auto cross = [&](int i, int j, int k) {
return (c(k) - c(i)) * (a[j] - a[i]) - (c(j) - c(i)) * (a[k] - a[i]);
};
int t = 0;
for (int j = l; j <= n; ++j) {
while (t > 1 && 0 <= cross(s[t - 1], s[t], j)) --t;
s[++t] = j;
}
for (int i = l + 1, j = 1; i <= n; ++i) {
while (s[j] < i && j < t && val(s[j], a[i]) < val(s[j + 1], a[i])) ++j;
opt[l][i] = s[j];
f[l & 1][i] = val(s[j], a[i]);
}
}
cout << f[k & 1][n] << '\n';
for (int v = n, l = k; v = opt[l--][v]; ) s[l] = v;
for (int l = 0; l < k; ++l) cout << s[l] << ' ';
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:32:27: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
for (int v = n, l = k; v = opt[l--][v]; ) s[l] = v;
~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 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 |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
4 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 |
4 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 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 |
4 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 |
4 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
4 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 |
4 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 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 |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 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 |
5 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 |
4 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
1280 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 |
5 ms |
640 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 |
8 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 |
9 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 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 |
8 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 |
6 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 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 |
34 ms |
9336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
34 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
35 ms |
6824 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
37 ms |
7160 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
5888 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
31 ms |
6648 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
41 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
4224 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
4224 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
283 ms |
81400 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
18 ms |
4224 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
497 ms |
81420 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
311 ms |
57832 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
338 ms |
61816 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
233 ms |
50936 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
254 ms |
57848 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
329 ms |
73464 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
