# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73556 | Vardanyan | Split the sequence (APIO14_sequence) | C++14 | 2068 ms | 2636 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.
#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 100000+7;
int a[N];
long long pref[N];
//int suf[N];
pair<long long,int> dp[N][208];
int par[N][208];
int main()
{
int n,k;
cin>>n>>k;
for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
for(int i = 1;i<=n;i++) pref[i] = pref[i-1]+a[i];
// for(int i = n;i>=1;i--) suf[i] = suf[i+1]+a[i];
for(int kk = 1;kk<=k;kk++){
for(int i = kk+1;i<=n;i++){
for(int j = dp[i][kk-1].second;j<i;j++){
if(dp[kk-1][j].first+(pref[i]-pref[j])*pref[j]>=dp[kk][i].first){
dp[kk][i].first = dp[kk-1][j].first+(pref[i]-pref[j])*pref[j];
dp[kk][i].second = j;
}
}
}
}
cout<<dp[k][n].first<<endl;
int kk = k;
int nn = n;
int ul = 0;
while(kk>0){
cout<<dp[kk][nn].second<<" ";
nn = dp[kk][nn].second;
kk--;
ul++;
}
cout<<endl;
// cout<<ul<<endl;
return 0;
}
/*
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... |