#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
#define N 100005
#define K 202
int n, k; ll cum[N];
ll curc[N], curm[N], curi[N], curlen, advc[N], advm[N], advi[N], advlen, dp;
int tr[K][N], ans[K];
void ins(ll c, ll m, ll i) {
if (advlen && m == advm[advlen-1]) {
if (c > advc[advlen-1]) advlen--;
else return;
}
while (advlen >= 2 && (c - advc[advlen-2])/(advm[advlen-2] - m) > (c - advc[advlen-1])/(advm[advlen-1] - m)) advlen--;
advc[advlen] = c; advm[advlen] = m; advi[advlen++] = i;
}
void swp() {
swap(curc, advc); swap(curm, advm); swap(curi, advi); swap(curlen, advlen);
advlen = 0;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%lld", cum+i);
for (int i = 1; i <= n; i++) cum[i] += cum[i-1];
for (int i = 1; i <= n; i++) ins(-(cum[i]*cum[i]), cum[i], i);
swp();
for (int lay = 1; lay <= k; lay++) {
int hllpnt = 0;
for (int i = lay+1; i <= n; i++) {
ll qx = cum[i];
while (hllpnt+1 < curlen && curi[hllpnt+1] < i && curm[hllpnt]*qx + curc[hllpnt] <= curm[hllpnt+1]*qx + curc[hllpnt+1]) hllpnt++;
dp = curm[hllpnt]*qx + curc[hllpnt];
tr[lay][i] = curi[hllpnt];
if (i < n) ins(dp - cum[i]*cum[i], cum[i], i);
}
swp();
}
printf("%lld\n", dp);
int trn = n, trk = k;
while (trk) {
trn = tr[trk][trn];
trk--;
ans[trk] = trn;
}
for (int i = 0; i < k; i++) printf("%d%c", ans[i], i==k-1 ? '\n' : ' ');
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &k);
~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:26:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (int i = 1; i <= n; i++) scanf("%lld", cum+i);
~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
4984 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
8 ms |
5220 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
7 ms |
5220 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
9 ms |
5236 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
11 ms |
5236 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
7 ms |
5288 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
7 ms |
5288 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
10 ms |
5288 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
9 ms |
5288 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
9 ms |
5288 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
8 ms |
5288 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
5324 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
10 ms |
5324 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
28 ms |
5460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
8 ms |
5460 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
13 ms |
5460 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
10 ms |
5460 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
23 ms |
5460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
12 ms |
5460 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
10 ms |
5460 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
13 ms |
5460 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
5460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
8 ms |
5460 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
94 ms |
6360 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
9 ms |
6360 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
67 ms |
6360 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
89 ms |
6360 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
95 ms |
6360 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
27 ms |
6360 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
19 ms |
6360 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
32 ms |
6360 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6360 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
8 ms |
6360 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
98 ms |
6892 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
8 ms |
6892 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
105 ms |
6924 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
121 ms |
6924 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
108 ms |
6924 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
104 ms |
6956 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
26 ms |
6956 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
43 ms |
6956 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
6956 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
6956 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
175 ms |
13980 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
11 ms |
13980 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
111 ms |
13980 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
132 ms |
13980 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
143 ms |
13980 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
129 ms |
13980 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
131 ms |
13980 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
159 ms |
13980 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
13980 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
40 ms |
13980 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
898 ms |
84316 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
34 ms |
84316 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
975 ms |
85232 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
758 ms |
85232 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
830 ms |
85232 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
663 ms |
85232 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
671 ms |
85232 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
972 ms |
85232 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
