# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
220002 | MKopchev | Split the sequence (APIO14_sequence) | C++14 | 2090 ms | 3176 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 nmax=1e5+42,kmax=2e2+5;
long long dp[kmax][nmax];
int n,k;
int inp[nmax];
long long pref[nmax];
long long ask(int l,int r)
{
return pref[r]-pref[l-1];
}
long long score(int j,int i)
{
return ask(1,j)*ask(j+1,i);
}
int output[nmax];
int main()
{
scanf("%i%i",&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%i",&inp[i]);
pref[i]=pref[i-1]+inp[i];
}
for(int cuts=1;cuts<=k;cuts++)
for(int i=1;i<=n;i++)
{
if(i<cuts){dp[cuts][i]=-1e18;continue;}
for(int j=cuts-1;j<i;j++)
dp[cuts][i]=max(dp[cuts][i],dp[cuts-1][j]+score(j,i));
}
printf("%lld\n",dp[k][n]);
int pos=n;
for(int cuts=k;cuts>=1;cuts--)
{
for(int j=pos-1;j>=1;j--)
if(dp[cuts][pos]==dp[cuts-1][j]+score(j,pos))
{
output[cuts]=j;
pos=j;
break;
}
}
for(int i=1;i<=k;i++)
{
printf("%i",output[i]);
if(i==k)printf("\n");
else printf(" ");
}
return 0;
}
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... |