博客
关于我
HDU - 4597 Play Game (博弈 + 区间dp)
阅读量:284 次
发布时间:2019-03-01

本文共 2083 字,大约阅读时间需要 6 分钟。

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

Sample Output

53 105

题意:Alice和Bob轮流在两个数组中取数字,每次只能取走一个数组的第一个或最后一个数字,问Alice取走数字的最大和

思路:dp[i][j][p][q] 表示第一个数组剩余 [i, j] ,第二个数组剩余 [p, q] 时,执行下一步的人可以获得的最大价值,它可以由上一步对方的最大值转移过来,4种转移方式:数组一的第一个、数组一的最后一个、数组二的第一个、数组二的最后一个。

for循环着实不好写,还是记忆化搜索8

#include 
using namespace std;typedef long long ll;const int inf = 0x3f3f3f3f;const int N = 25;int a[N], b[N], dp[N][N][N][N], n;int dfs(int i, int j, int p, int q, int sum) { if(i > j && p > q) return 0; if(dp[i][j][p][q]) return dp[i][j][p][q]; if(i <= j) { dp[i][j][p][q] = max(dp[i][j][p][q], sum - dfs(i + 1, j, p, q, sum - a[i])); dp[i][j][p][q] = max(dp[i][j][p][q], sum - dfs(i, j - 1, p, q, sum - a[j])); } if(p <= q) { dp[i][j][p][q] = max(dp[i][j][p][q], sum - dfs(i, j, p + 1, q, sum - b[p])); dp[i][j][p][q] = max(dp[i][j][p][q], sum - dfs(i, j, p, q - 1, sum - b[q])); } return dp[i][j][p][q];}int main(){// freopen("in.txt", "r", stdin); int t; scanf("%d", &t); while(t--) { scanf("%d", &n); int sum = 0; 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;}

 

转载地址:http://kcio.baihongyu.com/

你可能感兴趣的文章
mysql一个字段为空时使用另一个字段排序
查看>>
MySQL一个表A中多个字段关联了表B的ID,如何关联查询?
查看>>
MYSQL一直显示正在启动
查看>>
MySQL一站到底!华为首发MySQL进阶宝典,基础+优化+源码+架构+实战五飞
查看>>
MySQL万字总结!超详细!
查看>>
Mysql下载以及安装(新手入门,超详细)
查看>>
MySQL不会性能调优?看看这份清华架构师编写的MySQL性能优化手册吧
查看>>
MySQL不同字符集及排序规则详解:业务场景下的最佳选
查看>>
Mysql不同官方版本对比
查看>>
MySQL与Informix数据库中的同义表创建:深入解析与比较
查看>>
mysql与mem_细说 MySQL 之 MEM_ROOT
查看>>
MySQL与Oracle的数据迁移注意事项,另附转换工具链接
查看>>
mysql丢失更新问题
查看>>
MySQL两千万数据优化&迁移
查看>>
MySql中 delimiter 详解
查看>>
MYSQL中 find_in_set() 函数用法详解
查看>>
MySQL中auto_increment有什么作用?(IT枫斗者)
查看>>
MySQL中B+Tree索引原理
查看>>
mysql中cast() 和convert()的用法讲解
查看>>
mysql中datetime与timestamp类型有什么区别
查看>>