#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100'005;
const ll inf = 1e18;
int a[N];
ll prf[N];
array<ll, 2> dp[205][N];
void solve(int j, int l, int r, int optl, int optr) {
if (l > r || optl > optr) return;
int i = (l + r) >> 1;
for (int k = optl; k <= min(i - 1, optr); k++) {
dp[j][i] = max(dp[j][i], {dp[j - 1][k][0] + prf[k] * (prf[i] - prf[k]), k});
}
solve(j, l, i - 1, optl, min(optr, (int)dp[j][i][1]));
solve(j, i + 1, r, max(optl, (int)dp[j][i][1]), optr);
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
prf[i] = prf[i - 1] + a[i];
}
m++;
for (int i = 1; i <= n; i++) dp[0][i] = {-inf, -1};
for (int j = 1; j <= m; j++) {
dp[j][0] = {-inf, -1};
solve(j, 1, n, 0, n - 1);
}
cout << dp[m][n][0] << '\n';
int j = m, i = n;
vector<int> ans;
while (j > 1) {
ans.push_back(dp[j][i][1]);
i = dp[j][i][1];
j--;
}
reverse(ans.begin(), ans.end());
for (auto x : ans) {
cout << x << ' ';
}
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
10704 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
16732 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
10 ms |
80472 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
18780 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
14684 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
41308 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
20828 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
14680 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
24924 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
20 ms |
130908 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
17 ms |
130136 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
20 ms |
130648 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
22 ms |
130904 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
9 ms |
72284 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
7 ms |
47452 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
11 ms |
90632 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Runtime error |
30 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
6748 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
6748 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Runtime error |
92 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
40 ms |
8544 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
37 ms |
8776 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
722 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
