# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208036 | rzbt | Split the sequence (APIO14_sequence) | C++14 | 2100 ms | 91720 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 100005
#define MAXK 205
typedef long long ll;
using namespace std;
ll n,u;
ll dp[MAXN][MAXK];
ll niz[MAXN];
ll suma[MAXN];
ll sec[MAXN][MAXK];
pair<ll,ll> prava[MAXN][MAXK];
vector<pair<pair<ll,ll>,ll> > prave;
int main()
{
scanf("%lld %lld", &n, &u);
for(ll i=1;i<=n;i++)
scanf("%lld",niz+i);
for(ll i=1;i<=n;i++)
suma[i]=suma[i-1]+niz[i];
for(ll k=1;k<=u;k++){
prave.clear();
for(ll d=k+1;d<=n;d++){
//while(!prave.empty())
for(ll i=k+1;i<=d;i++){
ll tr=suma[i-1]*(suma[d]-suma[i-1])+dp[i-1][k-1];
if(tr>dp[d][k]){
sec[d][k]=i-1;
dp[d][k]=tr;
}
}
//printf(" %lld %lld %lld\n",d,k,dp[d][k]);
}
}
printf("%lld\n",dp[n][u]);
ll poc=n;
for(ll i=u;i>0;i--){
poc=sec[poc][i];
printf("%lld ",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... |