博客
关于我
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 快速自增假数据, 新增假数据,mysql自增假数据
查看>>
Mysql 报错 Field 'id' doesn't have a default value
查看>>
MySQL 报错:Duplicate entry 'xxx' for key 'UNIQ_XXXX'
查看>>
mysql 排序id_mysql如何按特定id排序
查看>>
Mysql 提示:Communication link failure
查看>>
mysql 插入是否成功_PDO mysql:如何知道插入是否成功
查看>>
Mysql 数据库InnoDB存储引擎中主要组件的刷新清理条件:脏页、RedoLog重做日志、Insert Buffer或ChangeBuffer、Undo Log
查看>>
mysql 数据库备份及ibdata1的瘦身
查看>>
MySQL 数据库备份种类以及常用备份工具汇总
查看>>
mysql 数据库存储引擎怎么选择?快来看看性能测试吧
查看>>
MySQL 数据库操作指南:学习如何使用 Python 进行增删改查操作
查看>>
MySQL 数据库的高可用性分析
查看>>
Mysql 数据库重置ID排序
查看>>
Mysql 数据类型一日期
查看>>
MySQL 数据类型和属性
查看>>
mysql 敲错命令 想取消怎么办?
查看>>
Mysql 整形列的字节与存储范围
查看>>
mysql 断电数据损坏,无法启动
查看>>
MySQL 日期时间类型的选择
查看>>