usaco A Game(dp)

/*
ID: modengd1
PROG: game1
LANG: C++
*/
#include <iostream>
#include <stdio.h>
#include <memory.h>
using namespace std;
int sum[101];
int dp[101][101];//在i-j中能得到的最大值
int N;
int main()
{
    freopen("game1.in","r",stdin);
    freopen("game1.out","w",stdout);
    memset(dp,0,sizeof(dp));
    scanf("%d",&N);
    for(int i=1;i<=N;i++)
    {
        scanf("%d",&sum[i]);
        dp[i][i]=sum[i];
        sum[i]+=sum[i-1];
    }
    for(int i=1;i<N;i++)
    {
        for(int j=1;j<=N-i;j++)
            dp[j][j+i]=sum[j+i]-sum[j-1]-min(dp[j+1][j+i],dp[j][j+i-1]);
    }
    cout<<dp[1][N]<<‘ ‘<<sum[N]-dp[1][N]<<endl;
    return 0;
}