Revenge of LIS II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1195 Accepted Submission(s): 400
Problem Description
In computer s...
分类:
其他好文 时间:
2015-05-02 09:46:20
阅读次数:
117
DZY Loves Topological SortingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 922 Accepted Submission(s): 269Problem Description
A topolog...
分类:
其他好文 时间:
2015-05-01 23:53:36
阅读次数:
129
Gauss FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2584 Accepted Submission(s): 1078Problem Description
Without expecting, Ange...
分类:
其他好文 时间:
2015-05-01 23:52:19
阅读次数:
139
并查集+最小生成树Eddy's pictureTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7669Accepted Submission(s):...
分类:
其他好文 时间:
2015-05-01 18:37:41
阅读次数:
117
并查集+最小生成树Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15844Accepted Submissio...
分类:
其他好文 时间:
2015-05-01 13:18:27
阅读次数:
108
Consumer
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)
Total Submission(s): 1435 Accepted Submission(s): 752
Problem Description
FJ is going to do ...
分类:
其他好文 时间:
2015-05-01 09:29:31
阅读次数:
125
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1253思路分析:因为问题需要寻找到达终点的最短的距离(最短的步数),即在状态转换图上需要找出层次最浅的的状态(A-1, B-1, C-1),所以采用bfs更快能找出答案;另外,若采用dfs则比较困难,需要...
分类:
其他好文 时间:
2015-04-30 21:46:58
阅读次数:
200