hdu 4597 Play Game (记忆化搜索 区间dp)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 | #include<cstdio> #include<cstring> #include<cmath> #include<iostream> #include<algorithm> using namespace std; int dp[30][30][30][30]; int vis[30][30][30][30]; int a[2][30],sum[2][30]; int dfs( int i, int j, int k, int l) { if (vis[i][j][k][l]==1) return dp[i][j][k][l]; int minn1,minn2,minn; vis[i][j][k][l]=1; if (i>k&&j>l) { return 0; } else { minn1=minn2=1e9; if (i<=k) { minn1=min(dfs(i+1,j,k,l),dfs(i,j,k-1,l)); } if (j<=l) { minn2=min(dfs(i,j+1,k,l),dfs(i,j,k,l-1)); } minn=min(minn1,minn2); //printf("%d...\n",minn); } dp[i][j][k][l]=sum[0][k]-sum[0][i-1]+sum[1][l]-sum[1][j-1]-minn; return dp[i][j][k][l]; } int main() { int t,n; int i,j,k; scanf ( "%d" ,&t); while (t--) { memset (vis,0, sizeof (vis)); scanf ( "%d" ,&n); for (i=0;i<2;i++) { sum[i][0]=0; for (j=1;j<=n;j++) { scanf ( "%d" ,&a[i][j]); sum[i][j]=sum[i][j-1]+a[i][j]; } } printf ( "%d\n" ,dfs(1,1,n,n)); } return 0; } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步