#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, maxk = 200 + 5;
const long long inf = 1e14;
long long dp[2][maxn], s[maxn];
int t[maxk][maxn];
struct line {
long long a, b;
int i;
long long operator()(const long long &x) const { return a * x + b; }
bool checkfront(const line &rhs, const long long &x) const { return operator()(x) >= rhs(x); }
long double inter(const line &rhs) const { return 1.0 * (rhs.b - b) / (a - rhs.a); }
bool checkback(const line &rhs, const line &pivot) { return inter(pivot) <= rhs.inter(pivot); }
};
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int a; cin >> a;
s[i] = s[i - 1] + a;
}
dp[0][0] = -inf;
for (int i = 1; i <= n; ++i) dp[0][i] = 0;
int cur = 1;
for (int i = 1; i <= k; ++i) {
// memset(dp[cur], 0, sizeof(dp[cur]));
fill(dp[cur], dp[cur] + maxn, -inf);
deque<line> dq; dq.push_back({ s[1], -s[1] * s[1], 1 });
// cout << "dp[" << i << "][" << 1 << "] = " << dp[cur][1] << endl;
for (int j = 2; j <= n; ++j) {
while (dq.size() >= 2 && dq[1].checkfront(dq[0], s[j])) dq.pop_front();
dp[cur][j] = dq.front()(s[j]);
// cout << "dp[" << i << "][" << j << "] = " << dp[cur][j] << endl;
t[i][j] = dq.front().i;
// cout << "t[" << i << "][" << j << "] = " << t[i][j] << endl;
line tmp = { s[j], dp[cur ^ 1][j] - s[j] * s[j], j };
while (dq.size() >= 2 && tmp.checkback(dq[dq.size() - 1], dq[dq.size() - 2])) dq.pop_back();
// if (dq.size() && dq.back().a == tmp.a && dq.back().b >= tmp.b) continue;
dq.push_back(tmp);
}
cur ^= 1;
}
/* int cur = 1; dp[0][0] = -inf;
for (int i = 1; i <= k; ++i) {
fill(dp[cur], dp[cur] + maxn, -inf);
for (int j = 1; j <= n; ++j) {
for (int p = 1; p < j; ++p) {
if (dp[cur ^ 1][p] + s[p] * (s[j] - s[p]) > dp[cur][j]) {
dp[cur][j] = dp[cur ^ 1][p] + s[p] * (s[j] - s[p]);
t[i][j] = p;
}
}
}
cur ^= 1;
} */
cout << dp[cur ^ 1][n] << endl;
stack<int> ans;
int now = n;
for (int i = k; i > 0; --i) {
ans.push(t[i][now]);
now = t[i][now];
}
while (ans.size()) cout << ans.top() << ' ', ans.pop(); cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
84608 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
84608 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
13 ms |
84608 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
84608 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
13 ms |
84608 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
13 ms |
84608 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
84608 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
84608 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
19 ms |
84608 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
26 ms |
84608 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
26 ms |
84608 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
84608 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
23 ms |
84608 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
84608 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
84608 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
84740 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
84772 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
126 ms |
84740 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
84740 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
69 ms |
84740 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
99 ms |
84740 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
96 ms |
84740 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
59 ms |
84740 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
89 ms |
84740 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
89 ms |
84740 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
85528 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
19 ms |
85660 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
716 ms |
85796 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
19 ms |
85796 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1079 ms |
85780 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
729 ms |
85528 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
719 ms |
85796 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
556 ms |
85796 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
616 ms |
85660 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
746 ms |
85660 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
