#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
using pll = pair<int64_t, int64_t>;
#define x first
#define y second
const int64_t INF = 4e18;
int ccw(pll p0, pll p1, pll p2)
{
double cross = (double) (p1.x - p0.x) * (p2.y - p0.y) - (double) (p2.x - p0.x) * (p1.y - p0.y);
if (cross < -1e-5) return -1;
if (cross > 1e-5) return 1;
return 0;
}
int64_t calc(pll p, int64_t x) { return p.x * x + p.y; }
const int MAXN = 100007, MAXK = 207;
int trace[MAXK][MAXN];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int N, K;
cin >> N >> K;
vector<int64_t> S(N + 1, 0);
for (int i = 1; i <= N; ++i) cin >> S[i], S[i] += S[i - 1];
vector<int64_t> ans(N + 1, INF);
ans[0] = 0;
vector<pll> vec;
for (int t = 0; t <= K; ++t) {
int ptr = 0;
vec.clear();
for (int i = 0; i <= N; ++i) {
for (; ptr + 1 < (int) vec.size() && calc(vec[ptr], S[i]) > calc(vec[ptr + 1], S[i]); ++ptr);
int64_t newAns = (ptr >= (int) vec.size() ? INF : calc(vec[ptr], S[i]) + S[i] * S[i]);
if (ptr < ((int) vec.size())) trace[t][i] = vec[ptr].x / -2;
if (ans[i] != INF) {
pll cur(-2 * S[i], ans[i] + S[i] * S[i]);
while (((int) vec.size()) > 1 && ccw(cur, vec.rbegin()[0], vec.rbegin()[1]) <= 0) vec.pop_back();
vec.push_back(cur);
ptr = min(ptr, ((int) vec.size()) - 1);
}
ans[i] = newAns;
}
}
cout << (S[N] * S[N] - ans[N]) / 2 << endl;
for (int t = K, i = N; t > 0; --t) {
i = ((int) (upper_bound(S.begin(), S.begin() + i, trace[t][i]) - S.begin())) - 1;
cout << i << ' ';
}
cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
416 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
896 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
42 ms |
9460 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
35 ms |
6008 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
39 ms |
6904 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
39 ms |
7412 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
6132 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
34 ms |
7012 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
45 ms |
8564 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
4856 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
19 ms |
4856 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
386 ms |
82940 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
5748 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
597 ms |
82388 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
403 ms |
58884 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
391 ms |
63212 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
283 ms |
52076 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
330 ms |
58988 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
419 ms |
74536 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
