# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107272 | abil | Split the sequence (APIO14_sequence) | C++14 | 97 ms | 9328 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>
using namespace std;
const int N = (int)100007;
int n, k, par[207][N];
long long dp[3][N];
int arr[N];
int f(int l,int r){
return arr[l] * (arr[r] - arr[l]);
}
void solve(int g,int l,int r,int optl,int optr){
if(l > r){
return;
}
int mid = (l + r) >> 1, opt;
for(int i = optl; i <= min(optr,mid - 1); i++){
if(dp[(g % 2)][mid] <= dp[(g - 1) % 2][i] + f(i,mid)){
dp[(g % 2)][mid] = dp[(g - 1) % 2][i] + f(i,mid);
opt = i;
}
}
par[g][mid] = opt;
solve(g,l,mid - 1, optl, opt);
solve(g,mid + 1, r, opt, optr);
}
main(){
scanf("%d %d",&n, &k);
for(int i = 1;i <= n; i++){
scanf("%d", &arr[i]);
arr[i] = arr[i - 1] + arr[i];
}
for(int i = 1;i <= k; i++){
solve(i,1,n,1,n - 1);
}
printf("%lld\n",dp[(k % 2)][n]);
while (k > 0 && n > 0) {
printf ("%d ", par[k][n]);
n = par[k][n];
k--;
}
}
/*
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... |