Submission #899957

#	Time	Username	Problem	Language	Result	Execution time	Memory
899957		1075508020060209tc	Split the sequence (APIO14_sequence)	C++14	28 / 100	2074 ms	49772 KiB

sequence

#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
#define SZ(x) (int)(x).size()
int n;int K;
int ar[100005];
int ps[100005];
int dp[100005][205];
signed frm[100005][205];
signed main(){
cin>>n>>K;
K++;
for(int i=1;i<=n;i++){
    cin>>ar[i];
    ps[i]=ar[i]+ps[i-1];
}
dp[1][1]=0;
for(int i=1;i<=n;i++){
    for(int j=2;j<=K;j++){
        for(int k=i;k>=1;k--){
            dp[i][j]=max(dp[i][j],dp[k-1][j-1]+(ps[i]-ps[k-1])*(ps[k-1]));
            if(dp[i][j]==dp[k-1][j-1]+(ps[i]-ps[k-1])*(ps[k-1])){
                frm[i][j]=k-1;
            }
        }
    }
}
/*
for(int i=1;i<=n;i++){
    for(int j=1;j<=K;j++){
        cout<<dp[i][j]<<" ";
    }cout<<"\n";
}
*/
cout<<dp[n][K]<<"\n";

int nw=n;
int k=K;
vector<int>vc;
for(int i=1;i<=K-1;i++){
    nw=frm[nw][k];
    vc.push_back(nw);
    k--;
}
reverse(vc.begin(),vc.end());
for(int i=0;i<vc.size();i++){
    cout<<vc[i]<<" ";
}


}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:49:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 | for(int i=0;i<vc.size();i++){
      |             ~^~~~~~~~~~

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