#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "
const int MAX_N = 1e5 + 10, MAX_K = 210;
ll dp[MAX_N][MAX_K], hist[MAX_N][MAX_K];
ll pref[MAX_N], arr[MAX_N];
struct Line {
ll a, b, ind;
long double p;
Line() {}
Line(ll _a, ll _b, ll _ind) {a = _a; b = _b; ind = _ind;}
ll y(ll x) {return a * x + b;}
long double getWhere(const Line &other) {
if(a == other.a) {
return -mod;
} else {
return (long double)(b - other.b) / (long double)(other.a - a);
}
}
};
struct LineContainer {
deque<Line> lines;
void addLine(Line curr) {
while(!lines.empty() && lines.back().getWhere(curr) <= lines.back().p) {
lines.pop_back();
}
if(lines.empty()) {
curr.p = -mod;
} else {
curr.p = lines.back().getWhere(curr);
}
lines.push_back(curr);
}
pair<ll, int> get(ll x) {
while(lines.size() > 1 && lines[1].p <= x) {
lines.pop_front();
}
return {lines.front().y(x), lines.front().ind};
}
};
LineContainer lc[MAX_K];
void output(int n, int k) {
if(k == 0) {
return;
}
output(hist[n][k], k - 1);
cout << hist[n][k] << " ";
}
signed main() {
//ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i ++) {
cin >> arr[i];
pref[i] = pref[i - 1] + arr[i];
}
for(int i = 0; i <= n; i ++) {
for(int j = 1; j <= k; j ++) {
dp[i][j] = -mod;
}
}
for(int i = 1; i <= k; i ++) {
lc[i].addLine(Line(0, -mod, -1));
}
lc[0].addLine(Line(0, 0, -1));
for(int i = 1; i <= n; i ++) {
for(int j = k; j >= 1; j --) {
auto get = lc[j - 1].get(pref[i]);
dp[i][j] = get.first;
hist[i][j] = get.second;
lc[j].addLine(Line(pref[i], dp[i][j] - pref[i] * pref[i], i));
}
lc[0].addLine(Line(pref[i], 0 - pref[i] * pref[i], i));
}
/*for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= k; j ++) {
for(int q = 1; q < i; q ++) {
if(chkmax(dp[i][j], dp[q][j - 1] + pref[q] * pref[i] - pref[q] * pref[q])) {
hist[i][j] = q;
}
}
}
}*/
cout << dp[n][k] << endl;
output(n, k);
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
512 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
512 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3840 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
3968 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
4096 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
3840 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
4096 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
3968 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
4096 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
13 ms |
4608 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
3968 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
3968 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
34336 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
21 ms |
34680 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
142 ms |
36600 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
25 ms |
34560 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
95 ms |
36216 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
100 ms |
35320 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
120 ms |
36344 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
102 ms |
36728 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
106 ms |
36088 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
130 ms |
36228 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
93 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
