#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
// change if necessary
#define MAXN 100010
using namespace std;
int n, k;
int nums[MAXN];
ll psum[MAXN];
pair<ll, int> dp[210][MAXN];
int arr[210];
void solve(int i, int l, int r, int opt_l, int opt_r) {
if (l > r) return;
int m = (l + r) / 2;
ll max_prod = 0;
int pos = opt_l;
for (int j = opt_l; j <= min(m - 1, opt_r); j++) {
ll before = psum[j + 1];
ll after = psum[m + 1] - psum[j + 1];
ll prod = before * after + dp[i - 1][j].first;
if (prod >= max_prod) {
max_prod = prod;
pos = j;
}
}
dp[i][m] = {max_prod, pos};
if (l < m) solve(i, l, m - 1, opt_l, pos);
if (m < r) solve(i, m + 1, r, pos, opt_r);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> nums[i];
}
for (int i = 1; i <= n; i++) {
psum[i] = psum[i - 1] + nums[i - 1];
}
for (int i = 1; i <= k; i++) {
solve(i, 0, n - 1, 0, n - 1);
}
pair<ll, int> ans = {0, 0};
for (int i = k; i < n; i++) {
ans = max(ans, dp[k][i]);
}
cout << ans.first << '\n';
for (int i = k - 1; i >= 0; i--) {
arr[k - i - 1] = ans.second + 1;
ans = dp[i][ans.second];
}
for (int i = k - 1; i >= 0; i--) {
cout << arr[i] << ' ';
}
cout << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
416 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
2432 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1792 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
2176 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
2432 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
896 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
7 ms |
4864 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
8 ms |
4864 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
7 ms |
4224 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
4864 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
4864 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
1280 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
2176 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
2 ms |
896 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
66 ms |
33164 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
2 ms |
896 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
55 ms |
20088 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
53 ms |
23292 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
67 ms |
24952 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
47 ms |
20344 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
55 ms |
23288 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
69 ms |
29816 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
6272 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
24 ms |
6144 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Runtime error |
319 ms |
131076 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |