hdoj 4597 Play Game

dp[i][j][k][l] 表示地一个序列[i,j]段之和与第二个序列的[k,l]段之和的和。

每次去前四个状态的最小值

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int dp[31][31][31][31];
int a[31],b[31];

int dfs(int x1,int y1,int x2,int y2,int sum)
{
    int maxn=0;
    if(x1>y1&&x2>y2) return 0;
    if(dp[x1][y1][x2][y2]>0) return dp[x1][y1][x2][y2];
    if(x1<=y1)
    {
        maxn=max(sum-dfs(x1+1,y1,x2,y2,sum-a[x1]),maxn);
        maxn=max(sum-dfs(x1,y1-1,x2,y2,sum-a[y1]),maxn);
    }
    if(x2<=y2)
    {
        maxn=max(sum-dfs(x1,y1,x2+1,y2,sum-b[x2]),maxn);
        maxn=max(sum-dfs(x1,y1,x2,y2-1,sum-b[y2]),maxn);
    }
    dp[x1][y1][x2][y2]=maxn;
    return maxn;

}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int sum=0,n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&b[i]);
            sum+=b[i];
        }
        memset(dp,0,sizeof(dp));
        printf("%d\n",dfs(1,n,1,n,sum));
    }
    return 0;
}