#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef tuple<ll, ll, double, ll> t;
int N, K;
vector<ll> psum;
double intersect(t L1, t L2) {
return (get<1>(L2)-get<1>(L1))/(get<0>(L1)-get<0>(L2));
}
int main() {
ios::sync_with_stdio(false); cin.tie(NULL);
cin >> N >> K; psum.resize(N);
for (auto &i: psum) cin >> i;
for (int i=1; i<N; i++) psum[i] = psum[i-1] + psum[i];
int prev[K][N];
ll DP[2][N];
t g;
fill(&prev[0][0], &prev[K-1][N], 0);
fill(&DP[0][0], &DP[1][N], 0);
for (int k=0; k<K; k++) {
deque<t> F; F.push_front(t(0, ll(-1e14), -1, -1));
for (int i=k+1; i<N; i++) {
g = t(psum[i-1], DP[(k%2)^1][i-1]-(psum[i-1]*psum[i-1]), 0, i-1);
if (get<0>(F.back()) == get<0>(g) && get<1>(F.back()) < get<1>(g)) {
F.pop_back();
while (!F.empty()) {
g = t(get<0>(g), get<1>(g), intersect(F.back(), g), get<3>(g));
if (get<2>(F.back()) < get<2>(g)) break;
F.pop_back();
}
F.push_back(g);
}
else if (get<0>(F.back()) != get<0>(g)) {
while (!F.empty()) {
g = t(get<0>(g), get<1>(g), intersect(F.back(), g), get<3>(g));
if (get<2>(F.back()) < get<2>(g)) break;
F.pop_back();
}
F.push_back(g);
}
ll X = psum[i];
while (F.size() > 1 && get<2>(F.at(1)) < X) F.pop_front();
DP[k%2][i] = get<0>(F.front()) * X + get<1>(F.front());
prev[k][i] = get<3>(F.front());
}
}
cout << DP[(K-1)%2][N-1] << '\n';
int temp = N-1, q = K-1;
vector<int> L;
while (q>=0) {
L.push_back(prev[q][temp]+1);
temp = prev[q--][temp];
}
sort(L.begin(), L.end());
for (auto &i: L) cout << i << ' ';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
320 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
320 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
316 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
320 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
320 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1148 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
980 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
444 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
596 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
932 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
40 ms |
8532 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
844 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
30 ms |
5460 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
37 ms |
6288 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
37 ms |
6612 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
5532 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
6100 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
39 ms |
7764 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
5204 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
14 ms |
5520 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
410 ms |
82772 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
15 ms |
5708 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
474 ms |
82784 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
330 ms |
58916 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
363 ms |
63188 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
282 ms |
52300 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
287 ms |
59184 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
375 ms |
74828 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
