#include <bits/stdc++.h>
using namespace std;
struct Line
{
long a, b;
int idx;
};
long double isect(Line v1, Line v2)
{
auto [a1, b1, i1] = v1;
auto [a2, b2, i2] = v2;
return (b2 - b1) / (long double)(a1 - a2);
}
long eval(Line v, long x)
{
auto [a, b, i] = v;
return a * x + b;
}
struct CHT
{
deque<Line> lines;
// insert ax+b line, a should be increasing
void push_line(Line l)
{
if (lines.empty())
lines.push_back(l);
if (lines.back().a == l.a && lines.back().b >= l.b)
{
lines.back() = l;
return;
}
while (lines.size() >= 2 &&
isect(*lines.rbegin(), *next(lines.rbegin())) >= isect(*lines.rbegin(), l))
lines.pop_back();
lines.push_back(l);
}
// queries x, find max(ax+b) x should be increasing
pair<long, int> query(long x)
{
while (lines.size() >= 2 &&
eval(*lines.begin(), x) <= eval(*next(lines.begin()), x))
lines.pop_front();
return make_pair(eval(*lines.begin(), x), lines.begin()->idx);
}
};
pair<long, vector<int>> solve(vector<long> A, int K)
{
ios::sync_with_stdio(false);
cin.tie(0);
int N = A.size();
vector<long> S(N + 1);
vector<long> pD(N + 1);
vector<vector<int>> bktk(K + 1, vector<int>(N + 1));
for (int i = 0; i < N; ++i)
S[i + 1] = S[i] + A[i];
for (int k = 1; k <= K; ++k)
{
CHT cht;
vector<long> D(N + 1);
cht.push_line({S[N], 0L, 0});
for (int i = 1; i <= N; ++i)
{
auto [v, q] = cht.query(S[i]);
bktk[k][i] = q;
D[i] = -S[i] * S[i] + v;
cht.push_line({S[N] + S[i],
pD[i] - S[i] * S[N],
i});
}
pD = D;
}
int cur = pD.rend() - max_element(next(pD.rbegin()), pD.rend()) - 1;
long ans = pD[cur];
vector<int> ret(K);
for (int k = K; k >= 1; --k)
{
ret[k - 1] = cur;
cur = bktk[k][cur];
}
return {ans, ret};
}
int main()
{
int N, K;
cin >> N >> K;
vector<long> A(N);
for (auto &x : A)
cin >> x;
auto [ans, res] = solve(A, K);
cout << ans << endl;
for (int x : res)
cout << x << " ";
cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 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 |
1 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 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 |
0 ms |
212 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
212 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 |
0 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 |
2 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 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 |
340 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 |
7 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
980 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
596 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
852 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
1000 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
83 ms |
8656 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
980 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
42 ms |
5588 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
45 ms |
6316 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
53 ms |
6740 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
36 ms |
5588 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
42 ms |
6268 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
56 ms |
7892 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
6716 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
23 ms |
6844 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
572 ms |
84424 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
33 ms |
7308 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
667 ms |
84612 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
512 ms |
60748 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
554 ms |
65140 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
376 ms |
54152 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
386 ms |
61076 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
560 ms |
76796 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
