# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997499 | vjudge1 | Split the sequence (APIO14_sequence) | C++17 | 2041 ms | 4188 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;
#define int long long
signed main()
{
int n,k,x,su=0;
cin>>n>>k;
int a[n],ans=0,pre[n]={};
for (int i=0;i<n;i++)
{
cin>>a[i];
su+=a[i];
pre[i]=su;
}
int dp[n][k]={};
for (int i=1;i<n;i++)
for (int j=i-1;j>=0;j--)
dp[i][0]=max(dp[i][0],(pre[i]-pre[j])*pre[j]);
for (int l=1;l<k;l++)
{
for (int i=l+1;i<n;i++)
for (int j=i-1;j>=l;j--)
dp[i][l]=max(dp[i][l],dp[j][l-1]+(pre[i]-pre[j])*pre[j]);
}
cout<<dp[n-1][k-1]<<endl;
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... |