ACM----【最短路】
文章平均质量分 80
iviko
这个作者很懒,什么都没留下…
展开
-
POJ 3268 双向Dijkstra
Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13020 Accepted: 5832 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to原创 2014-10-04 23:09:35 · 907 阅读 · 0 评论 -
POJ 2253 Dijkstra
Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27128 Accepted: 8824 Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who原创 2015-01-25 22:08:39 · 532 阅读 · 0 评论 -
HDU 1162 Prim
Eddy's picture Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7287 Accepted Submission(s): 3689 Problem Description Eddy begins to like p原创 2015-01-26 21:55:29 · 540 阅读 · 0 评论 -
POJ 2240 Bellman_Ford
Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16429 Accepted: 6909 Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a原创 2015-01-26 16:11:06 · 567 阅读 · 0 评论 -
HDU 1142
A Walk Through the Forest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5999 Accepted Submission(s): 2215 Problem Description Jimmy expe原创 2015-01-26 19:24:36 · 538 阅读 · 0 评论 -
浙大计算机研究生复试上机考试-2010年 最短路径问题
最短路径问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14405 Accepted Submission(s): 4408 Problem Description 给你n个点,m条无向边,每条边都有长度d和花费p,给你起原创 2015-01-23 15:10:03 · 836 阅读 · 0 评论 -
POJ 1125 Floyd
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27978 Accepted: 15528 Description Stockbrokers are known to overreact to rumours. You have been contracted to dev原创 2015-01-26 09:43:07 · 609 阅读 · 0 评论 -
POJ 1860 Bellman_Ford
Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 21092 Accepted: 7554 Description Several currency exchange points are working in our city. Let us suppose that each p原创 2015-01-25 18:42:06 · 459 阅读 · 0 评论 -
POJ 3259 Bellman_Ford
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 32474 Accepted: 11808 Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes.原创 2015-01-25 19:45:54 · 458 阅读 · 0 评论