hdu4597 (博弈dp)play game
来源:互联网 发布:d3.js 中文官网 编辑:程序博客网 时间:2024/06/05 16:39
Problem Description
Alice and Bob are playing a game. There are two piles of cards. There are N cards in each pile, and each card has a score. They take turns to pick up the top or bottom card from either pile, and the score of the card will be added to his total score. Alice and Bob are both clever enough, and will pick up cards to get as many scores as possible. Do you know how many scores can Alice get if he picks up first?
Input
The first line contains an integer T (T≤100), indicating the number of cases. Each case contains 3 lines. The first line is the N (N≤20). The second line contains N integer ai (1≤ai≤10000). The third line contains N integer bi (1≤bi≤10000).
Output
For each case, output an integer, indicating the most score Alice can get.
Sample Input
2 1 23 53 3 10 100 20 2 4 3思路:dp[al][ar][bl][br]表示在pile1的数还剩下从al到ar(开区间),pile2的数还剩下bl到br的情况下,先手取得的最大值。所以,每次选择当前所有减去下一个人的最大值(四个方向),即可理解:你的最大等于剩余所有减去下一个人取最大(奇偶奇偶奇。。。。。)#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;const int maxn = 20 + 5;int a[maxn];int b[maxn];int suma[maxn],sumb[maxn];int dp[maxn][maxn][maxn][maxn];int dfs(int al,int ar,int bl,int br){ if(dp[al][ar][bl][br] != -1) return dp[al][ar][bl][br]; dp[al][ar][bl][br] = 0; if(al < ar-1) dp[al][ar][bl][br] = a[al+1] + (suma[ar-1]-suma[al+1]+sumb[br-1]-sumb[bl]-dfs(al+1,ar,bl,br)); if(al < ar-1) dp[al][ar][bl][br] = max(dp[al][ar][bl][br],a[ar-1] + (suma[ar-2]-suma[al]+sumb[br-1]-sumb[bl]-dfs(al,ar-1,bl,br))); if(bl < br-1) dp[al][ar][bl][br] = max(dp[al][ar][bl][br],b[bl+1] + (suma[ar-1]-suma[al]+sumb[br-1]-sumb[bl+1]-dfs(al,ar,bl+1,br))); if(bl < br-1) dp[al][ar][bl][br] = max(dp[al][ar][bl][br],b[br-1] + (suma[ar-1]-suma[al]+sumb[br-2]-sumb[bl]-dfs(al,ar,bl,br-1))); return dp[al][ar][bl][br];}int main(){ int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); suma[0] = 0;sumb[0] = 0; for(int i = 1;i <= n;i++) { scanf("%d",&a[i]); suma[i] = suma[i-1] + a[i]; } for(int i = 1;i <= n;i++) { scanf("%d",&b[i]); sumb[i] = sumb[i-1]+b[i]; } memset(dp,-1,sizeof(dp)); printf("%d\n",dfs(0,n+1,0,n+1)); } return 0;}
0 0
- hdu4597 (博弈dp)play game
- HDU4597:Play Game(记忆化搜索(dp))(博弈)
- hdu4597 Play Game(DFS)
- hdu4597 Play Game
- HDU4597:Play Game(记忆化)
- HDU 4597 Play Game (DP,记忆化搜索,博弈)
- HDU 4597 Play Game (博弈 + 区间dp)
- hdu 4597 Play Game (博弈dp)
- hdu4597(区间dp)
- hdu4597 PlayGame(区间dp)
- Play a game + 博弈
- 2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4597 Play Game (博弈 + 区间dp)
- HDU 4597.Play Game(DP)
- HDU-4597 Play Game (区间DP)
- [DP]Play Game
- HDU 1564 Play a game(规律博弈)
- HDU 1564 Play a game(巴什博弈)
- HDOJ 题目1564 play a game(博弈)
- IOS 播放雪花的两种方式(代码方式)
- spring中IOC是什么意思 个人觉得解释的非常有意思
- Java面向对象基础知识
- 设计模式C++实现(2)——策略模式
- 那些年我们一起清除过的浮动
- hdu4597 (博弈dp)play game
- 不能将参数 2 从“TCHAR *”转换为“const char *”
- 毛玻璃效果shader
- 学习笔记(八)对象的集合(三)
- spring中IOC是什么意思 个人觉得解释的非常有意思
- [Android实例] Handler+ExecutorService(线程池)+MessageQueue模式+缓存模式
- SpringMVC关于AOP拦截controller的注意事项
- spring中IOC是什么意思 个人觉得解释的非常有意思
- 44 - 判断扑克牌是否是顺子