CF DP专题训练

博弈+dp MemSQL Start[c]UP 3.0 - Round 1 C Pie Rules

#include<bits/stdc++.h>
#define rep(i,n,m) for(int i=n;i<=m;i++)
#define per(i,n,m) for(int i=n;i>=m;i--)
using namespace std;
int n,a[55],sum;
int dp[55][2];
int main(){
	cin>>n;
	rep(i,1,n){
		cin>>a[i];
		sum+=a[i];
	}
	per(i,n,1){
		dp[i][0]=max(a[i]+dp[i+1][1],dp[i+1][0]);
		dp[i][1]=min(a[i]+dp[i+1][1],dp[i+1][0]);
	}
	cout<<sum-dp[1][0]<<" "<<dp[1][0]<<endl;
    return 0;
}