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 climb to the top?
递推公式T(n) = T(n-1) + T(n-2);
...
分类：
其他好文 时间：
2015-01-12 17:39:19
阅读次数：
227
题目大意：
给你一个图，n（点数），m（边数），l，和每个点上的标号h，h表示到源点的最短路，h=1表示是源点，h=l表示是汇点，显然是一个层次图，然后要你求最大流。
解题思路：
首先我们注意一下数据范围，然后我就怂了，本来看到题目觉得就是分分钟dinic上去秒掉的，但是我还是too naive，所以我只能滚粗去学预流推进了。。。。。。。
由于预流推进很难讲，所以请大家自己去查阅资...
分类：
其他好文 时间：
2015-01-12 14:45:26
阅读次数：
183
点击打开链接
1119. Metro
Time limit: 0.5 second
Memory limit: 64 MB
Many of SKB Kontur programmers like to get to work by Metro because the main office is situated quite close the statio...
分类：
其他好文 时间：
2015-01-10 18:10:42
阅读次数：
246
Problem Description
TT and FF are ... friends. Uh... very very good friends -________-b
FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. ...
分类：
其他好文 时间：
2015-01-10 15:18:18
阅读次数：
186
5.3 Tuples and SequencesWe saw that lists and strings have many common properties, e.g., indexing and slicing operations. They are two examples ofsequ...
分类：
编程语言 时间：
2015-01-10 08:49:40
阅读次数：
275
Pat1087代码
题目描述：
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.
Input S...
分类：
其他好文 时间：
2015-01-10 01:31:07
阅读次数：
245
By ruthless,I mean I don‘t have any morality or feeling. I don‘t sorrow,I don‘t cry,I don‘t feel sad.I don‘t care about anything. I‘m way too immature. all the these are just because I‘m not good e...
分类：
其他好文 时间：
2015-01-09 23:54:51
阅读次数：
393
hdu 5137 How Many Maos Does the Guanxi Worth —— black 的专栏 —— waShaXiu...
分类：
其他好文 时间：
2015-01-09 10:47:37
阅读次数：
193
How many integers can you find
Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status
Appoint description:
System Crawler (2015-01-07)
Description...
分类：
其他好文 时间：
2015-01-09 09:21:44
阅读次数：
252
题目：
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1 and 0 respectively...
分类：
编程语言 时间：
2015-01-08 15:29:48
阅读次数：
162
