# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344904 | spike1236 | Split the sequence (APIO14_sequence) | C++14 | 2076 ms | 81388 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
const int MAXN = 1e5 + 1;
long long dp[MAXN][2];
long long pref[MAXN];
int opt[MAXN][201];
void calc(int k, int l, int r, int optl, int optr) {
if(l > r) return;
int m = l + r >> 1;
long long res = 0;
opt[m][k] = optl;
for(int i = optl; i <= std::min(m - 1, optr); ++i) {
long long cur = dp[i][(k & 1) ^ 1] + pref[i] * (pref[m] - pref[i]);
if(cur > res) {
res = cur;
opt[m][k] = i;
}
}
dp[m][k & 1] = res;
calc(k, l, m - 1, optl, opt[m][k]);
calc(k, m + 1, r, opt[m][k], optr);
}
int main() {
int n, K;
scanf("%d %d\n", &n, &K);
for(int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
pref[i] = pref[i - 1] + x;
}
for(int i = 1; i <= K; ++i)
calc(i, i + 1, n, i, n);
printf("%I64ld\n", dp[n][K & 1]);
int pos = n;
for(int i = K; i > 0; --i)
pos = opt[pos][i], printf("%d ", pos);
return 0;
}
/**
7 3
4 1 3 4 0 2 3
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |