HDU 4597 Play Game

题目链接

什么都不想说，最近状态暴跌。。

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 using namespace std;
 int p[][];
 int sum[][];
 int dp1[][],dp2[][];
 int dp[][][][];
 int dfs1(int x1,int y1)
 {
     if(dp1[x1][y1])
     return dp1[x1][y1];
     if(x1 == y1)
     return dp1[x1][y1] = p[][x1];
     return dp1[x1][y1] = max(sum[][y1]-sum[][x1]-dfs1(x1+,y1)+p[][x1],sum[][y1-]-sum[][x1-]-dfs1(x1,y1-)+p[][y1]);
 }
 int dfs2(int x1,int y1)
 {
     if(dp2[x1][y1])
     return dp2[x1][y1];
     if(x1 == y1)
     return dp2[x1][y1] = p[][x1];
     return dp2[x1][y1] = max(sum[][y1]-sum[][x1]-dfs2(x1+,y1)+p[][x1],sum[][y1-]-sum[][x1-]-dfs2(x1,y1-)+p[][y1]);
 }
 int dfs(int x1,int y1,int x2,int y2)
 {
     int maxz = ;
     if(dp[x1][y1][x2][y2])
     return dp[x1][y1][x2][y2];
     if(x1 == y1&&x2 == y2)
     return dp[x1][y1][x2][y2] = max(p[][x1],p[][x2]);
     else if(x1 == y1)
     {
         maxz = sum[][y2]- sum[][x2-]-dfs2(x2,y2)+p[][x1];
         maxz = max(maxz,sum[][y1]-sum[][x1-]+sum[][y2]-sum[][x2]-dfs(x1,y1,x2+,y2)+p[][x2]);
         maxz = max(maxz,sum[][y1]-sum[][x1-]+sum[][y2-]-sum[][x2-]-dfs(x1,y1,x2,y2-)+p[][y2]);
     }
     else if(x2 == y2)
     {
         maxz = sum[][y1] - sum[][x1-] - dfs1(x1,y1) + p[][x2];
         maxz = max(maxz,sum[][y1]-sum[][x1]+sum[][y2]-sum[][x2-]-dfs(x1+,y1,x2,y2)+p[][x1]);
         maxz = max(maxz,sum[][y1-]-sum[][x1-]+sum[][y2]-sum[][x2-]-dfs(x1,y1-,x2,y2)+p[][y1]);
     }
     else
     {
         maxz = max(maxz,sum[][y1]-sum[][x1]+sum[][y2]-sum[][x2-]-dfs(x1+,y1,x2,y2)+p[][x1]);
         maxz = max(maxz,sum[][y1-]-sum[][x1-]+sum[][y2]-sum[][x2-]-dfs(x1,y1-,x2,y2)+p[][y1]);
         maxz = max(maxz,sum[][y1]-sum[][x1-]+sum[][y2]-sum[][x2]-dfs(x1,y1,x2+,y2)+p[][x2]);
         maxz = max(maxz,sum[][y1]-sum[][x1-]+sum[][y2-]-sum[][x2-]-dfs(x1,y1,x2,y2-)+p[][y2]);
     }
     return dp[x1][y1][x2][y2] = maxz;
 }
 int main()
 {
     int t,n,i,j;
     scanf("%d",&t);
     while(t--)
     {
         memset(dp,,sizeof(dp));
         memset(dp1,,sizeof(dp1));
         memset(dp2,,sizeof(dp2));
         memset(sum,,sizeof(sum));
         scanf("%d",&n);
         for(i = ; i <= ; i ++)
         {
             for(j = ; j <= n; j ++)
             {
                 scanf("%d",&p[i][j]);
                 sum[i][j] = sum[i][j-] + p[i][j];
             }
         }
         printf("%d\n",dfs(,n,,n));
     }
     return ;
 }