随笔分类 -  图论-最短路

POJ 3013 Big Christmas Tree (最短路)
摘要：Big Christmas Tree Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 22903 Accepted: 4962 Description Christmas is coming to KCM city. Suby 阅读全文
posted @ 2016-07-28 22:38 季末Despair 阅读(260) 评论(0) 推荐(0)
POJ 1062 昂贵的聘礼 (最短路)
摘要：昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Time Limit: 1000MS Memory Limit: 10000K Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000 阅读全文
posted @ 2016-07-02 17:01 季末Despair 阅读(170) 评论(0) 推荐(0)
POJ 2253 Frogger (求每条路径中最大值的最小值，Dijkstra变形)
摘要：Frogger Time Limit: 1000MS Memory Limit: 65536K Time Limit: 1000MS Memory Limit: 65536K Description Freddy Frog is sitting on a stone in the middle of 阅读全文
posted @ 2016-07-02 16:53 季末Despair 阅读(460) 评论(0) 推荐(1)
HDU 4725 The Shortest Path in Nya Graph (最短路)
摘要：The Shortest Path in Nya Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description This is a very easy proble 阅读全文
posted @ 2016-06-29 17:14 季末Despair 阅读(266) 评论(0) 推荐(0)
POJ 1502 MPI Maelstrom (最短路)
摘要：MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Time Limit: 1000MS Memory Limit: 10000K Description BIT has recently taken delivery of their new 阅读全文
posted @ 2016-06-29 17:01 季末Despair 阅读(284) 评论(0) 推荐(0)
POJ 3268 Silver Cow Party (最短路)
摘要：Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Time Limit: 2000MS Memory Limit: 65536K Description One cow from each of N farms (1 ≤ N ≤ 100 阅读全文
posted @ 2016-06-29 16:58 季末Despair 阅读(125) 评论(0) 推荐(0)
POJ 1797 Heavy Transportation (Dijkstra算法变形)
摘要：Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Time Limit: 3000MS Memory Limit: 30000K Description Background Hugo Heavy is happy. After 阅读全文
posted @ 2016-06-29 16:55 季末Despair 阅读(213) 评论(0) 推荐(0)
HDU 2544 最短路
摘要：最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description 在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服 阅读全文
posted @ 2016-06-18 23:38 季末Despair 阅读(126) 评论(0) 推荐(0)
POJ-1847 Tram
摘要：Tram Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a swit 阅读全文
posted @ 2016-06-13 00:07 季末Despair 阅读(175) 评论(0) 推荐(0)