 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:Player 1 on first team, then player 2 on second team and so on. You need DP to solve this problem. Ask if you want more hint.In Reply To:Player 1 on first team, then player 2 on second team and so on. You need DP to solve this problem. Ask if you want more hint. Posted by:michael at 2007-01-07 09:39:30 //博弈DP //双人nim，谁拿最后的石头谁输 //现在变成两只队伍，每个队伍有n个队员，两个队轮流操作，每个队员能拿的最大个数是不同的，至少是拿一个 //给定一个局面求是必胜还是必败，我们可以用一个dp数组将当前状态是必胜还是必败记录下来 //这其实就是一个极大极小的过程 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
