Submission #535184

#	Time	Username	Problem	Language	Result	Execution time	Memory
535184		ala2	Split the sequence (APIO14_sequence)	C++14	0 / 100	2085 ms	1200 KiB

sequence

#include <bits/stdc++.h>

using namespace std;
int n,m;
int a[1001000];
int p[1001000];
int f(int i,int j,int k)
{
    if(k==0)
        return 0;
    if(i==j)
        return 0;
    int g=0;
    for(int ii=i; ii<j; ii++)
    {
        for(int kk=0; kk<k; kk++)
        {
            int x=p[ii]-p[i-1];
            int y=p[j]-p[ii];
            g=max(g, f(i,ii,kk)+f(ii+1,j,k-kk-1)+x*y);
        }
    }
    return g;
}
vector<int>v;
void d(int i,int j,int k)
{
    if(k==0)
        return ;
    if(i==j)
        return ;
    for(int ii=i; ii<j; ii++)
    {
        for(int kk=0; kk<k; kk++)
        {
            int x=p[ii]-p[i-1];
            int y=p[j]-p[ii];
         //   cout<<"     "<<f(i,ii,kk)<<"   "<<f(ii+1,j,k-kk-1)<<"  "<< x*y << "  "<<f(i,j,k)<<endl;
            if( f(i,ii,kk) + f(ii+1,j,k-kk-1) + x*y ==f(i,j,k))
            {

                v.push_back(ii);
                d(i,ii,kk);
                d(ii+1,j,k-kk-1);
                return ;

            }

        }
    }


}
int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
        p[i]=a[i]+p[i-1];
    }
    cout<<f(1,n,m)<<endl;
    d(1,n,m);
    for(auto i:v)
        cout<<i<<" " ;


}

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