#include <iostream>
#include <cstring>
using namespace std;
typedef long long LL;
typedef long double LD;
const int N = 100010, M = 210;
int n, k, p[N][M];
int q[N], hh, tt;
LL dp1[N], dp2[N]; // rolling array
LL s[N];
LD y(int i) {
return dp2[i] - s[i] * s[i];
}
LD slope(int i, int j) {
if (s[i] == s[j]) {
return -1;
}
return (1.0 * y(i) - y(j)) / ((LD)s[j] - s[i]);
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> s[i];
s[i] += s[i - 1];
}
for (int i = 1; i <= k; i++) {
hh = tt = 0; q[hh] = 0;
memcpy(dp2, dp1, sizeof dp2);
for (int j = 1; j <= n; j++) {
while (hh < tt && slope(q[hh], q[hh + 1]) <= s[j]) {
hh++;
}
int t = q[hh];
p[j][i] = t;
dp1[j] = dp2[t] + s[t] * (s[j] - s[t]);
while (hh < tt && slope(q[tt - 1], q[tt]) >= slope(q[tt], j)) {
tt--;
}
q[++tt] = j;
}
}
cout << dp1[n] << "\n";
while (p[n][k]) {
cout << p[n][k] << ' ';
n = p[n][k--];
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
3176 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
3160 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
3160 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
3416 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
3260 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3168 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
2 ms |
3164 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
3256 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
3168 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
5 ms |
3292 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
4 ms |
3160 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
6 ms |
3160 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
7 ms |
3316 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
2 ms |
3164 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
3164 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
2 ms |
3160 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3256 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
3168 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
10 ms |
3304 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
3164 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
10 ms |
3164 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
9 ms |
3168 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
11 ms |
3308 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
9 ms |
3168 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
3304 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
3304 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
11612 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
4 ms |
11612 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
54 ms |
11612 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
11612 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
50 ms |
11644 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
51 ms |
11640 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
64 ms |
11704 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
55 ms |
11660 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
45 ms |
11612 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
63 ms |
11608 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
85340 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
30 ms |
85392 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
480 ms |
85852 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
33 ms |
85844 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
776 ms |
85544 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
490 ms |
85548 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
576 ms |
85832 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
388 ms |
85500 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
400 ms |
85840 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
507 ms |
85704 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |