Submission #339201

#	Time	Username	Problem	Language	Result	Execution time	Memory
339201		Kerim	Split the sequence (APIO14_sequence)	C++17	28 / 100	2078 ms	2196 KiB

sequence

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
ll dp[MAXN],par[MAXN];
const int N=202;
int ata[N][MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
    	int x;scanf("%d",&x);
    	par[i]=par[i-1]+x;
    }	
	for(int h=1;h<=k;h++)
		for(int i=n;i>=h+1;i--){
			dp[i]=-1;
			for(int j=0;j<i;j++)
				if(umax(dp[i],dp[j]+par[i]*par[j]-par[j]*par[j]))
					ata[h][i]=j;
		}
	printf("%lld\n",dp[n]);
	vector<int>ans;int who=ata[k][n],rem=k;
	while(who)
		ans.pb(who),who=ata[--rem][who];
	reverse(all(ans));
	tr(it,ans)printf("%d ",*it);
	puts("");
	return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
sequence.cpp:28:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |      int x;scanf("%d",&x);
      |            ~~~~~^~~~~~~~~

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