USACO 2009 Nov Silver 1.A Coin Game 动态规划

最新推荐文章于 2019-10-10 15:28:19 发布

Farmer_ZY

最新推荐文章于 2019-10-10 15:28:19 发布

阅读量519

点赞数

分类专栏： USACO之趣

本文链接：https://blog.csdn.net/qq_35891865/article/details/52336783

版权

本文介绍了USACO中的一道题目，涉及到一个两人玩的硬币游戏。玩家轮流取硬币，每次至少取一枚，最多取上一轮对手取的两倍。目标是最大化自己取到的硬币总价值。问题转化为动态规划，通过从后往前推导状态转移方程来求解。代码实现中需要注意空间优化，避免超内存错误。

摘要由CSDN通过智能技术生成

Farmer John's cows like to play coin games so FJ has invented with a new two-player coin game called Xoinc for them.

Initially a stack of N (5 <= N <= 2,000) coins sits on the ground; coin i from the top has integer value C_i (1 <= C_i <= 100,000).

The first player starts the game by taking the top one or two coins (C_1 and maybe C_2) from the stack. If the first player takes just the top coin, the second player may take the following one or two coins in the next turn. If the first player takes two coins then the second player may take the top one, two, three or four coins from the stack. In each turn, the current player must take at least one coin and at most two times the amount of coins last taken by the opposing player. The game is over when there are no more coins to take.

Afterwards, they can use the value of the coins they have taken from the stack to buy treats from FJ, so naturally, their purpose in the game is to maxi