#include <bits/stdc++.h>
using namespace std;
void main_program();
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
main_program();
}
using ll = long long;
const ll inf = 1e18;
struct Line {
mutable ll k, m, p;
int idx;
bool operator<(const Line& o) const { return k < o.k; }
bool operator<(ll x) const { return p < x; }
};
struct LineContainer : multiset<Line, less<>> {
// (for doubles, use inf = 1/.0, div(a,b) = a/b)
static const ll inf = LLONG_MAX;
ll div(ll a, ll b) { // floored division
return a / b - ((a ^ b) < 0 && a % b); }
bool isect(iterator x, iterator y) {
if (y == end()) return x->p = inf, 0;
if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
else x->p = div(y->m - x->m, x->k - y->k);
return x->p >= y->p;
}
void add(ll k, ll m, int idx) {
auto z = insert({k, m, 0, idx}), y = z++, x = y;
while (isect(y, z)) z = erase(z);
if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
while ((y = x) != begin() && (--x)->p >= y->p)
isect(x, erase(y));
}
pair<ll, int> query(ll x) {
assert(!empty());
auto l = *lower_bound(x);
return {l.k * x + l.m, l.idx};
}
};
struct StaticLineContainer : vector<Line> {
int pt = 0;
ll f(Line line, ll x) { return line.k * x + line.m; }
bool cross(Line line1, Line line2, Line line3){
return (__int128)(line3.m - line1.m) * (line1.k - line2.k)
<= (__int128)(line2.m - line1.m) * (line1.k - line3.k);
}
void add(ll k, ll m, int idx){
push_back({k, m, 0, idx});
int sz = size();
while (sz >= 3 && cross(at(sz - 3), at(sz - 2), at(sz - 1))){
erase(end() - 2); sz--;
}
}
pair<ll, int> query(ll x){
if (pt >= (int)size()) pt = (int)size() - 1;
while (pt < (int)size() - 1 && f(at(pt), x) < f(at(pt+1), x)) pt++;
return {f(at(pt), x), at(pt).idx};
}
};
int n, k;
vector<ll> v, pfx;
void main_program(){
cin >> n >> k;
v.resize(n + 1);
for (int i = 1; i <= n; i++) cin >> v[i];
pfx.resize(n + 1);
for (int i = 1; i <= n; i++) pfx[i] = pfx[i-1] + v[i];
vector<ll> dp(n + 1, -inf);
vector<vector<int>> trace(k + 2, vector<int>(n + 1));
dp[0] = 0;
for (int j = 1; j <= k + 1; j++){
StaticLineContainer cht;
vector<ll> newdp(n + 1, -inf);
for (int i = 1; i <= n; i++){
// Add line (pfx[i-1] * S + dp[i-1] - pfx[i-1]^2)
cht.add(pfx[i-1], dp[i-1] - pfx[i-1] * pfx[i-1], i - 1);
// Find answer
tie(newdp[i], trace[j][i]) = cht.query(pfx[i]);
}
swap(dp, newdp);
}
cout << dp[n] << "\n";
vector<int> splits;
int crr = n;
for (int j = k + 1; j > 1; j--){
crr = trace[j][crr];
splits.push_back(crr);
}
reverse(splits.begin(), splits.end());
for (auto elem: splits) cout << elem << " ";
cout << "\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
424 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
348 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
1116 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
1116 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1228 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
1112 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
1116 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1456 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1424 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
71 ms |
9524 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
1720 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
40 ms |
6060 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
45 ms |
6780 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
57 ms |
7548 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
6908 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
53 ms |
7400 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
66 ms |
9020 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
13228 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
13624 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
677 ms |
90368 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
19 ms |
12720 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
726 ms |
89580 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
333 ms |
66492 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
565 ms |
70852 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
472 ms |
60724 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
499 ms |
67292 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
681 ms |
83860 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
