uva 10891 - Game of Sum

题目：uva 10891 - Game of Sum

题意：一排石子，每次可以从左边或者右边拿若干个，求先后手差值的最大值

思路：dp

#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define maxn 110
bool vis[maxn][maxn];
int dp[maxn][maxn];
int a[maxn],S[maxn];
int DP(int i,int j)
{
    if(vis[i][j])
        return dp[i][j];
    vis[i][j]=1;
    int cnt=0;
    for(int k=i;k<j;k++)
        cnt=min(cnt,DP(i,k));
    for(int k=i+1;k<=j;k++)
        cnt=min(cnt,DP(k,j));
    return dp[i][j]=S[j]-S[i-1]-cnt;
}
int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {
        S[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            S[i]=S[i-1]+a[i];
        }
        memset(vis,false,sizeof(vis));
        memset(dp,0,sizeof(dp));
        printf("%d\n",2*DP(1,n)-S[n]);
    }
    return 0;
}

优化后的：

#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 105;
int dp[maxn][maxn];
int a[maxn],S[maxn];
int l[maxn][maxn];
int r[maxn][maxn];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF&&n)
    {
        S[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            S[i]=S[i-1]+a[i];
        }
        for(int i=1;i<=n;i++)
        {
            dp[i][i]=a[i];
            l[i][i]=a[i];
            r[i][i]=a[i];
        }
        for(int i=n-1;i>=1;i--)
            for(int d=1;d+i<=n;d++)
            {
                int j=d+i;
                int cnt=0;
                cnt=min(cnt,l[i+1][j]);
                cnt=min(cnt,r[i][j-1]);
                dp[i][j]=S[j]-S[i-1]-cnt;
                l[i][j]=min(dp[i][j],l[i+1][j]);
                r[i][j]=min(dp[i][j],r[i][j-1]);
            }
        printf("%d\n",2*dp[1][n]-S[n]);
    }
    return 0;
}