本文介绍了如何解决HDU4111问题，重点在于Alice和Bob之间的游戏策略，通过动态规划和记忆化搜索来求解游戏过程中的sg值。
Alice and Bob
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 598 Accepted Submission(s): 207
Problem Description
Alice and Bob are very smart guys and they like to play all kinds of games in their spare time. The most amazing thing is that they always find the best strategy, and that's why they feel bored again and again. They just invented a new game, as they usually did.
The rule of the new game is quite simple. At the beginning of the game, they write down N random positive integers, then they take turns (Alice first) to either:
1. Decrease a number by one.
2. Erase any two numbers and write down their sum.
Wh
The rule of the new game is quite simple. At the beginning of the game, they write down N random positive integers, then they take turns (Alice first) to either:
1. Decrease a number by one.
2. Erase any two numbers and write down their sum.
Wh
最低0.47元/天 解锁文章
691
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
