HDU4597：Play Game(记忆化搜索（dp）)（博弈）

最新推荐文章于 2021-02-09 21:00:48 发布

mosquito_zm

最新推荐文章于 2021-02-09 21:00:48 发布

阅读量483

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈动态规划 acm 中等难度文章标签： acm dp 博弈

本文链接：https://blog.youkuaiyun.com/mosquito_zm/article/details/52267008

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 a i (1≤a i≤10000). The third line contains N integer b i (1≤b i≤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玩一个游戏，有两个长度为N的正整数数字序列，每次他们两个
只能从其中一个序列，选择两端中的一个拿走。他们都希望可以拿到尽量大
的数字之