6
16
2016
0

【bzoj1783】【Usaco2010 Jan】【博弈】Taking Turns

题意:

一排数,两个人轮流取数,保证取的位置递增,每个人要使自己取的数的和尽量大,求两个人都在最优策略下取的和各是多少。

Category: 树套树 | Tags: | Read Count: 185

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter

Host by is-Programmer.com | Power by Chito 1.3.3 beta | Theme: Aeros 2.0 by TheBuckmaker.com