#include <bits/stdc++.h>
using namespace std;
const int KMAX = 205;
const int NMAX = 100005;
long long dp[2][NMAX], psm[NMAX];
int fth[KMAX][NMAX];
void divide(int p, int le, int ri, int st, int en) {
if (le > ri) {
return; }
int md = (le + ri) / 2, l = p & 1;
dp[l][md] = -1;
for (int i = st; i <= md - 1 and i <= en; ++i) {
if (dp[l][md] < dp[l ^ 1][i] + psm[i] * (psm[md] - psm[i])) {
dp[l][md] = dp[l ^ 1][i] + psm[i] * (psm[md] - psm[i]);
fth[p][md] = i; } }
divide(p, le, md - 1, st, fth[p][md]);
divide(p, md + 1, ri, fth[p][md], en); }
int main(void) {
#ifdef HOME
freopen("sequence.in", "r", stdin);
freopen("sequence.out", "w", stdout);
#endif
int n, k; cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> psm[i]; psm[i] += psm[i - 1]; }
for (int i = 1; i <= k; ++i) {
divide(i, i + 1, n, i, n); }
cout << dp[k & 1][n] << endl;
for (int i = k, j = n; i >= 1; --i) {
cout << fth[i][j] << " "; j = fth[i][j]; }
return 0; }
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
276 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
320 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
4 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
12 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 |
14 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
1944 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
640 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
7 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
8 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
95 ms |
9208 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
7 ms |
684 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
80 ms |
5752 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
77 ms |
6636 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
70 ms |
7192 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
55 ms |
6008 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
67 ms |
6648 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
87 ms |
8312 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
3868 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
36 ms |
3840 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
998 ms |
80972 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
62 ms |
3832 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1585 ms |
81020 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
929 ms |
57484 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
899 ms |
61352 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
544 ms |
50424 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
813 ms |
57528 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
1020 ms |
73208 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |