#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (1e5)+1, K = 201;
struct MaxHull {
struct line {
ll m, c;
int i;
ll getVal(ll x) { return m*x + c; };
};
int idx = 0;
vector<line> lines;
bool bad(line l1, line l2, line l3) {
assert(l1.m <= l2.m && l2.m <= l3.m);
return (l3.c-l1.c)*(l1.m-l2.m) <= (l2.c-l1.c)*(l1.m-l3.m);
}
void update(ll m, ll c, int i) {
line l = {m, c, i};
while(lines.size() > 3 && bad(lines[lines.size()-2], lines[lines.size()-1], l)) lines.pop_back();
while(!lines.empty() && lines.back().m == l.m && lines.back().c <= l.c) lines.pop_back();
lines.push_back(l);
}
pair<ll, int> query(ll x) {
assert(!lines.empty());
while(idx+1 < lines.size() && lines[idx+1].getVal(x) >= lines[idx].getVal(x)) ++idx;
return make_pair(lines[idx].getVal(x), lines[idx].i);
}
} hull;
int n, k, a[N], trace[K][N];
ll ans, s[N], dp[2][N];
vector<int> order;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
s[i] = s[i-1] + a[i];
}
int curr = 0;
for(int cnt = 1; cnt <= k; cnt++, curr ^= 1) {
memset(dp[curr], 0, sizeof(dp[curr]));
hull.idx = 0;
hull.lines.clear();
// hull.update(0, 0, 0); // can do this to get rid of third line in update function
hull.update(s[cnt], dp[curr^1][cnt] - s[cnt]*s[cnt], cnt);
for(int i = cnt+1; i <= n; i++) {
tie(dp[curr][i], trace[cnt][i]) = hull.query(s[i]);
hull.update(s[i], dp[curr^1][i] - s[i]*s[i], i);
}
}
for(int cnt = k, i = n; cnt >= 1; i = trace[cnt][i], cnt--) order.push_back(trace[cnt][i]);
reverse(order.begin(), order.end());
cout << dp[curr^1][n] << endl;
for(int i: order) cout << i << ' ';
}
Compilation message
sequence.cpp: In member function 'std::pair<long long int, int> MaxHull::query(ll)':
sequence.cpp:26:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(idx+1 < lines.size() && lines[idx+1].getVal(x) >= lines[idx].getVal(x)) ++idx;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
83428 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
83428 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
83428 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
83428 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
9 ms |
83428 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
83428 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
83428 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
83428 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
83428 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
83428 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
83428 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
83428 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
13 ms |
83428 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
83428 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
83428 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83848 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
83848 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
46 ms |
84044 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
84044 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
83848 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
43 ms |
83848 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
43 ms |
84044 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
33 ms |
84044 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
39 ms |
84044 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
36 ms |
84044 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
88076 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
19 ms |
88076 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
366 ms |
88076 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
13 ms |
88076 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
599 ms |
88076 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
363 ms |
88076 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
393 ms |
88076 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
259 ms |
88076 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
313 ms |
88076 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
396 ms |
88076 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
