# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37617 | mr_banana | Split the sequence (APIO14_sequence) | C++14 | 2000 ms | 83272 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 MN=1e5+10;
long long dp[2][MN];
int a[MN];
long long ps[MN];
int dp2[MN][201];
long long sq(int x){
return 1ll*x*x;
}
void solve(int d,int l,int r,int ol,int orr){
int d1=d%2;
if(l>=r){
return ;
}
int mid=(l+r)/2;
int o=ol;
dp[d1][mid]=0;
for(int i=ol;i<orr && i<mid;i++){
long long tmp=dp[d1^1][i]+1ll*(ps[mid+1]-ps[i+1])*ps[i+1];
if(dp[d1][mid]<=tmp){
dp[d1][mid]=tmp;
o=i;
}
}
dp2[mid][d]=o;
solve(d,l,mid,ol,o+1);
solve(d,mid+1,r,o,orr);
}
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
ps[i+1]=ps[i]+a[i];
}
for(int i=1;i<=k;i++){
solve(i,0,n,0,n);
}
printf("%lld\n",dp[k%2][n-1]);
int x=n-1;
vector<int> ans;
for(int i=k;i>0;i--){
ans.push_back(dp2[x][i]+1);
x=dp2[x][i];
}
for(int i=k-1;i>=0;i--){
printf("%d ",ans[i]);
}
}
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... |