USACO Section 3.3 游戏 A Game

OJ:http://www.luogu.org/problem/show?pid=2734

#include<iostream>
#include<cstring>
using namespace std;
int n,sum,a[101],cal[101];
int mem[101][101];
int v[101][101];
int search(int s,int e){
	if(v[s][e])
		return mem[s][e];
	v[s][e]=1;
	if(s==e) return mem[s][e]=a[s];
	return mem[s][e]=max(cal[e-1]-cal[s-1]-search(s,e-1)+a[e],
							cal[e]-cal[s]-search(s+1,e)+a[s]);

}
void init()
{
	memset(v,0,sizeof(v));
	cal[0]=0;
	sum=0;
}
int main()
{

	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		cal[i]=cal[i-1]+a[i];
		sum+=a[i];
	}

	int x=search(1,n);
	cout<<x<<" "<<sum-x;

	return 0;
}