Submission #74714

#	Time	Username	Problem	Language	Result	Execution time	Memory
74714		OmarHashim	Split the sequence (APIO14_sequence)	C++14	71 / 100	149 ms	132096 KiB

sequence

#include<bits/stdc++.h>
using namespace std;

#define scl(x) scanf("%lld",&x)
#define sc(x)  scanf("%d",&x)
#define ll long long
#define lop(i,n) for(int i=0;i<n;++i)
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;

const int N=1e5+10,K=202;
ll dp[N][K],p[N];
int cut[N][K];
int n,k;
void solve(int s,int e,int l,int r,int rem){
	if(e<s)return;
	int m=s+((e-s)>>1);
	int opt=m;
	dp[m][rem]=-1e18;
	for(int i=max(l,m);i<=r;i++){
		ll res=(p[i]-p[m-1])*p[m-1]+dp[i+1][rem-1];
		if(res>dp[m][rem]){
			dp[m][rem]=res;
			opt=i;
		}
	}
	cut[m][rem]=opt;
	solve(s,m-1,l,opt,rem);
	solve(m+1,e,opt,r,rem);
}
int main(){
#ifndef ONLINE_JUDGE
	//freopen("i.txt","r",stdin);
#endif
	sc(n),sc(k);k++;
	for(int i=1;i<=n;i++)
		scl(p[i]),p[i]+=p[i-1];
	for(int i=0;i<=n;i++)
		dp[i][0]=-1e18;

	dp[n+1][0]=0;
	for(int rem=1;rem<=k;rem++)
		solve(1,n,1,n,rem);

	printf("%lld\n",dp[1][k]);
	int cur=1,rem=k;
	while(cur<=n&&cut[cur][rem]!=n){
		printf("%d",cut[cur][rem]);
		cur=cut[cur][rem]+1;
		rem--;
		if(cur<=n)printf(" ");
	}
	puts("");

}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sc(n),sc(k);k++;
       ^
sequence.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sequence.cpp:37:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scl(p[i]),p[i]+=p[i-1];
            ^

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