Gym - 101502J - Boxes Game（dp && 博弈）

#include <bits/stdc++.h>
using namespace std;
const int maxn  = 2000;
int dp[maxn][maxn],a[maxn],sum[maxn];
int dfs(int x,int y)
{
    if(dp[x][y] != -1) return dp[x][y];
    if( x == y) return dp[x][y] = a[x];
    int left = dfs(x + 1 , y);
    int right = dfs(x, y - 1);
    int t = sum[y] - sum[x-1];
    dp[x][y] = max(t - left, t- right);//前一状态取最大值（先手优先策略）
    return dp[x][y];
}
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        sum[0] = 0;
        for(int  i =1; i  <= n;i++)
        {
           scanf("%d",&a[i]);
           sum[i] = sum[i-1] + a[i];
        }
        memset(dp,-1,sizeof dp);
        int ans = dfs(1,n);
        printf("%d\n",2*ans - sum[n]);
    }
    return 0;
}