#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define ll long long
const int N = 100'005;
const ll inf = 1e18;
int a[N];
ll prf[N];
int prv[205][N];
array<ll, 2> dp[2][N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
prf[i] = prf[i - 1] + a[i];
}
m++;
for (int i = 1; i <= n; i++) dp[0][i] = {-inf, -1};
for (int j = 1; j <= m; j++) {
dp[j & 1][0] = {-inf, -1};
auto cmp = [&] (int x, int y, int z) {
return (__int128_t) (dp[(j - 1) & 1][x][0] - dp[(j - 1) & 1][y][0] - prf[x] * prf[x] + prf[y] * prf[y]) * (prf[z] - prf[y]) >=
(__int128_t) (dp[(j - 1) & 1][y][0] - dp[(j - 1) & 1][z][0] - prf[y] * prf[y] + prf[z] * prf[z]) * (prf[y] - prf[x]);
};
auto calc = [&] (int i, int k) {
return dp[(j - 1) & 1][k][0] + prf[k] * (prf[i] - prf[k]);
};
// {x, y, z}
deque<int> dq;
int sz = 0;
for (int i = 1; i <= n; i++) {
// cout << i << ' ' << sz << endl;
while (sz > 1 && cmp(dq[sz - 2], dq[sz - 1], i - 1)) {
dq.pop_back();
sz--;
}
dq.push_back(i - 1);
sz++;
while (sz > 1 && calc(i, dq[0]) <= calc(i, dq[1])) {
dq.pop_front();
sz--;
}
dp[j & 1][i] = {calc(i, dq[0]), dq[0]};
}
for (int i = 1; i <= n; i++) {
prv[j][i] = dp[j & 1][i][1];
}
}
cout << dp[m & 1][n][0] << '\n';
int j = m, i = n;
vector<int> ans;
while (j > 1) {
ans.push_back(prv[j][i]);
i = prv[j][i];
j--;
}
reverse(ans.begin(), ans.end());
for (auto x : ans) {
cout << x << ' ';
}
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8536 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
8664 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
8536 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
9 ms |
24924 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
8536 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
16728 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
12636 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
39 ms |
84556 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
8 ms |
61788 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
76376 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
10 ms |
84572 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
24924 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
16732 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
29020 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
84572 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
84572 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
74332 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
84568 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
84536 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
22876 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
37212 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
8796 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
8796 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
42 ms |
84876 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
8792 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
36 ms |
53840 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
34 ms |
62032 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
66252 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
27 ms |
53840 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
39 ms |
62088 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
42 ms |
76368 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
9052 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
13 ms |
9264 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
314 ms |
85292 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
9048 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
486 ms |
85124 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
323 ms |
62764 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
339 ms |
66860 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
267 ms |
56864 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
269 ms |
62756 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
370 ms |
79396 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
