Submission #1110650

#	Time	Username	Problem	Language	Result	Execution time	Memory
1110650		simona1230	Split the sequence (APIO14_sequence)	C++17	33 / 100	2053 ms	6472 KiB

sequence

#include <bits/stdc++.h>

using namespace std;
const int maxn=301;
long long n,k;
long long a[200001];
long long dp[maxn][maxn];
long long p[maxn];

void read()
{
    cin>>n>>k;
    for(long long i=1;i<=n;i++)
    {
        cin>>a[i];
        p[i]=p[i-1]+a[i];
    }
}

long long idx[maxn][maxn];

vector<long long> ans;

void rec(long long i,long long c)
{
    if(c==0)return;
    ans.push_back(idx[i][c]);
    rec(idx[i][c],c-1);
}


void solve()
{
    for(long long i=1;i<=n;i++)
    {
        for(long long j=1;j<=n;j++)
        {
            for(long long l=0;l<i;l++)
            {
                long long curr=dp[l][j-1]+(p[i]-p[l])*p[l];
                if(dp[i][j]<=curr)
                {
                    dp[i][j]=curr;
                    idx[i][j]=l;
                }
            }
        }
    }
    cout<<dp[n][k]<<endl;
    rec(n,k);
    sort(ans.begin(),ans.end());
    for(long long i=0;i<k;i++)
        cout<<ans[i]<<" ";
    cout<<endl;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	solve();
	return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29