#include <bits/stdc++.h>
using namespace std;
const int mxK = 202, mxN = 1e5+2;
bool vis[mxN];
int to[mxK][mxN], dq[mxN], l = 0, r = 0;
long long dpb[mxN], dp[mxN], pref[mxN];
long long sq(long long a) {
return a*a;
}
double cord(int x, int y) {
return (double)(dpb[x] - sq(pref[x]) - dpb[y] + sq(pref[y]))/(pref[y] - pref[x]);// (d-b)/(a-c)
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
pref[i] = pref[i-1] + x;
}
for (int i = 1; i <= k; ++i) {
dq[0] = r = l = 0;
for (int j = 1; j <= n; ++j) {
while (r - l > 0 && pref[j] != pref[j-1] && cord(dq[l], dq[l+1]) <= pref[j]) l++;
dp[j] = dpb[dq[l]] - sq(pref[dq[l]]) + pref[dq[l]] * pref[j];
to[i][j] = dq[l];
if (pref[j] != pref[dq[r-1]]) {
while (r - l > 0 && pref[j] != pref[dq[r-1]] && cord(dq[r-1], j) <= cord(dq[r], dq[r-1])) r--;
dq[++r] = j;
}
}
for (int j = 1; j <= n; ++j) {
dpb[j] = dp[j];
}
}
cout << dp[n] << '\n';
int idx = n;
for (int i = k; i >= 1; --i) {
if (!to[i][idx]) {
for (int j = n-1; j >= 1 && i >= 1; --j){
if (!vis[j]) {
--i;
cout << j << ' ';
}
}
break;
}
cout << to[i][idx] << ' ';
idx = to[i][idx];
vis[idx] = 1;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
2512 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
2512 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
20824 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4560 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
12636 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
12 ms |
78428 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
55644 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
10 ms |
72284 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
11 ms |
78428 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
18780 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
12636 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
22876 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
78368 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
78428 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
68188 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
78428 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
13 ms |
78340 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
16732 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
33116 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
39 ms |
78596 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
2648 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
34 ms |
49752 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
35 ms |
55896 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
48 ms |
60184 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
29 ms |
49744 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
34 ms |
56148 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
42 ms |
72440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
6744 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
11 ms |
6792 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
279 ms |
81904 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
10 ms |
6788 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
455 ms |
82028 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
293 ms |
60016 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
404 ms |
64128 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
250 ms |
51792 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
235 ms |
60496 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
313 ms |
74764 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
