A. Tanya and Stairways A. Tanya and Stairways Little girl Tanya climbs the stairs inside a multi-storey building. Every time Tanya climbs a stairway, ...
分类：
其他好文 时间：
2018-07-10 20:06:27
阅读次数：
244
题目链接：https://cn.vjudge.net/problem/HDU-4315 知识点： 博弈论 题目大意： \(Alice\) 和 \(Bob\) 轮流指挥 \(N\) 个人爬山，这 \(N\)个人在山顶下的不同层，国王是第 \(k\) 个人。山的每一层都最多只能容纳 \(1\) 个人（除 ...
分类：
其他好文 时间：
2018-06-10 12:02:04
阅读次数：
163
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y ...
分类：
其他好文 时间：
2018-05-27 10:43:35
阅读次数：
140
back function (return number) remember the structure Solution 2: dp keywards: how many ways and optimal 70. Climbing Stairs ...
分类：
其他好文 时间：
2018-05-16 15:15:34
阅读次数：
162
题目描述： On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two st ...
分类：
其他好文 时间：
2018-05-14 19:57:15
阅读次数：
163
In the year of 30XX30XX participants of some world programming championship live in a single large hotel. The hotel has nn floors. Each floor has mm s ...
分类：
其他好文 时间：
2018-04-30 13:24:58
阅读次数：
183
dp[i] means the minimum cost to reach i-th (index start from 0) stair. DP formula: dp[i] = min(dp[i-1], dp[i-2])+cost[i] i>=2 base cases: dp[0]=cost[0 ...
分类：
其他好文 时间：
2018-04-22 21:47:15
阅读次数：
130
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y ...
分类：
其他好文 时间：
2018-04-15 16:23:57
阅读次数：
143
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
分类：
其他好文 时间：
2018-04-07 17:48:48
阅读次数：
117
题目： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can yo ...
分类：
其他好文 时间：
2018-04-06 10:59:10
阅读次数：
139
