| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 36436 | ToMoClone | Split the sequence (APIO14_sequence) | C++14 | 1779 ms | 82796 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.
/*input
7 3
4 1 3 4 0 2 3
*/
#include <vector>
#include <stdio.h>
#include <algorithm>
using namespace std;
vector<long long> ans, val, sum;
int n, k, trace[201][100001];
void solve(int step, int l, int r, int u, int v){
int mid = (l + r) >> 1;
ans[mid] = 0;
for(int i = u; i <= min(mid, v); ++i)
if(ans[mid] <= 1ll * sum[i] * (sum[mid] - sum[i]) + val[i])
ans[mid] = 1ll * sum[i] * (sum[mid] - sum[i]) + val[i], trace[step][mid] = i;
if(l == r) return;
solve(step, l, mid, u, trace[step][mid]);
solve(step, mid + 1, r, trace[step][mid], v);
}
int main(){
scanf("%d%d", &n, &k);
sum.resize(n + 1), ans.resize(n + 1), val.resize(n + 1);
for(int i = 1; i <= n; ++i)
scanf("%lld", &sum[i]), sum[i] += sum[i - 1];
for(int i = 1; i <= k; ++i)
ans.swap(val), solve(i, 1, n, 1, n);
printf("%lld\n", ans[n]);
vector<int> res;
while(k != 0) printf("%d ", trace[k][n]), n = trace[k--][n];
}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... | ||||
