#include <bits/stdc++.h>
using namespace std;
//#define int long long
const int N = 1e5, MAXK = 200;
int n, K, prefix[N + 5], par[N + 5][MAXK + 5];
struct line {
long long m, b;
int par;
long long cross(line x) { return (x.b - b)/(m - x.m); }
long long query(int pos) { return (long long)pos*m + b; }
};
deque<line> dq[MAXK + 5];
pair<long long, int> query(int pos, int layer) {
while (dq[layer].size() >= 2) {
line f = dq[layer].front(), se = dq[layer][1];
if (f.query(pos) > se.query(pos)) break;
else dq[layer].pop_front();
}
return { dq[layer].front().query(pos), dq[layer].front().par };
}
void add(line x, int layer) {
while (dq[layer].size() >= 2) {
line f = dq[layer].back(), se = dq[layer][dq[layer].size() - 2];
if (f.m == x.m && f.b > x.b) return;
else if (f.m == x.m && f.b <= x.b) dq[layer].pop_back();
else if (x.cross(f) < x.cross(se)) dq[layer].pop_back();
else break;
}
dq[layer].push_back(x);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> K;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
prefix[i] = prefix[i - 1] + x;
}
vector<long long> dp(K + 5);
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= min(K, i - 1); j++) {
if (!j) { dp[0] = 0; continue; }
pair<long long, int> res = query(prefix[i], j - 1);
dp[j] = res.first, par[i][j] = res.second;
}
for (int j = 0; j <= min(K, i - 1); j++) {
line x = {(long long)prefix[i], (long long)-prefix[i]*prefix[i] + dp[j], i};
add(x, j);
}
}
cout << dp[K] << '\n';
int index = n, layer = K;
while (true) {
if (!par[index][layer]) break;
else cout << par[index][layer] << " ";
index = par[index][layer], layer--;
}
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
352 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
596 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1364 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1364 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1364 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1360 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1588 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1364 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8916 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
9044 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
70 ms |
9904 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9044 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
48 ms |
9792 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
52 ms |
9296 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
64 ms |
9804 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
48 ms |
9984 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
53 ms |
9716 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
65 ms |
9716 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
85068 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
42 ms |
85480 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
762 ms |
96148 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
45 ms |
86684 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
776 ms |
94632 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
586 ms |
89772 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
684 ms |
94884 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
554 ms |
93912 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
577 ms |
93648 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
718 ms |
94268 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
