# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208005 | rzbt | Split the sequence (APIO14_sequence) | C++14 | 12 ms | 760 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>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 1005
#define MAXK 55
typedef long long ll;
using namespace std;
int n,u;
int dp[MAXN][MAXK];
int niz[MAXN];
int suma[MAXN];
int sec[MAXN][MAXK];
int resi(int d,int k){
if(dp[d][k])return dp[d][k];
if(k==0 || d==1){
//printf(" %d %d %d %d\n",l,d,k,dp[l][d][k]);
return 0;
}
for(int i=k+1;i<d;i++){
int tr=suma[i-1]*(suma[d]-suma[i-1])+resi(i-1,k-1);
if(tr>dp[d][k]){
sec[d][k]=i-1;
dp[d][k]=tr;
}
}
//printf(" %d %d %d %d\n",l,d,k,dp[l][d][k]);
return dp[d][k];
}
int main()
{
scanf("%d %d", &n, &u);
for(int i=1;i<=n;i++)
scanf("%d",niz+i);
for(int i=1;i<=n;i++)
suma[i]=suma[i-1]+niz[i];
printf("%d\n",resi(n,u));
int poc=n;
for(int i=u;i>0;i--){
poc=sec[poc][i];
printf("%d ",poc);
}
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... |