Dijkstra
文章平均质量分 81
飘摇的尘土
这个作者很懒,什么都没留下…
展开
-
HDOJ2680 Choose the best route
Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7725 Accepted Submission(s): 2562 Problem Description On原创 2015-01-09 23:35:49 · 1015 阅读 · 0 评论 -
NYOJ 城市平乱
城市平乱 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 南将军统领着N个部队,这N个部队分别驻扎在N个不同的城市。 他在用这N个部队维护着M个城市的治安,这M个城市分别编号从1到M。 现在,小工军师告诉南将军,第K号城市发生了暴乱,南将军从各个部队都派遣了一个分队沿最近路去往暴乱城市平乱。 现在已知在任意两个城市之间原创 2015-01-19 14:20:32 · 698 阅读 · 0 评论 -
hdoj HDU Today
HDU Today Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16803 Accepted Submission(s): 3968 Problem Description 经过锦囊相助,海东集团终于度过了危机原创 2015-03-20 21:14:00 · 754 阅读 · 0 评论 -
HDOJ 最短路径问题
最短路径问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15296 Accepted Submission(s): 4629 Problem Description 给你n个点,m条无向边,每条边都有长原创 2015-03-28 12:02:07 · 802 阅读 · 0 评论 -
POJ1556The Doors【判断线段相交+dijkstra】
Language: Default The Doors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7177 Accepted: 2832 Description You are to find the length of the shortest path原创 2015-09-04 15:23:09 · 1218 阅读 · 0 评论 -
hdoj5137How Many Maos Does the Guanxi Worth【最短路】
How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 1519 Accepted Submission(s): 582 Problem Desc原创 2016-01-10 16:54:53 · 577 阅读 · 0 评论 -
hdoj3339In Action【单源最短路+01背包】
In Action Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4845 Accepted Submission(s): 1596 Problem Description Since 1945, wh原创 2016-01-29 14:18:17 · 481 阅读 · 0 评论