#include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#else
#define TEST(n) ((void)0)
#endif
using namespace std;
int PS[100001], P[201][100001];
long long D[2][100001];
void solve(int k, int l, int r, int s, int e)
{
if (l > r || s > e) return;
int m = (s + e) >> 1, L = min(m, r);
D[k & 1][m] = 0x7fffffffffffffffLL;
for (int i = l; i <= L; i++) {
if (D[k & 1][m] > D[(k - 1) & 1][i] + 1LL * (PS[m] - PS[i])*(PS[m] - PS[i])) {
D[k & 1][m] = D[(k - 1) & 1][i] + 1LL * (PS[m] - PS[i])*(PS[m] - PS[i]);
P[k][m] = i;
}
}
solve(k, l, P[k][m], s, m - 1);
solve(k, P[k][m], r, m + 1, e);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdout));
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> PS[i];
PS[i] += PS[i - 1];
D[0][i] = 1LL * PS[i] * PS[i];
}
for (int i = 1; i <= K; i++) {
solve(i, i, N, i, N);
}
cout << (1LL * PS[N] * PS[N] - D[K & 1][N]) / 2 << '\n';
for (; K; K--) {
cout << P[K][N] << ' ';
N = P[K][N];
}
return 0;
}
| # |
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 |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 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 |
5 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 |
5 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 |
4 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 |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 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 |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 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 |
5 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 |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 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 |
11 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 |
15 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
692 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
74 ms |
9332 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
84 ms |
5752 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
80 ms |
6648 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
77 ms |
7164 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
61 ms |
5880 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
80 ms |
6648 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
98 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
3704 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
34 ms |
3704 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
770 ms |
81112 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
3960 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1528 ms |
80764 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
938 ms |
57380 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
763 ms |
61560 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
541 ms |
50552 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
758 ms |
57464 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1000 ms |
73212 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
