[ACM]_最短路
关注
分享
扫一扫
同学少年
没有什么不可能！
展开
-
[ACM] HDU 4885 TIANKENG’s travel (特殊建图，最短路）
TIANKENG’s travel Problem Description TIANKENG has get a driving license and one day he is so lucky to find a car. Every day he drives the car around the city. After a month TIANKE原创 2015-01-13 17:51:01 · 1605 阅读 · 0 评论 -
[ACM] HDU 5137 How Many Maos Does the Guanxi Worth(去掉一个点使得最短路最大化)
How Many Maos Does the Guanxi WorthProblem Description"Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but als原创 2014-12-22 10:05:30 · 1380 阅读 · 0 评论 -
[ACM] POJ 2253 Frogger （最短路径变形，每条通路中的最长边的最小值）
FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24879 Accepted: 8076DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sudde原创 2014-07-16 13:32:09 · 3946 阅读 · 1 评论 -
[ACM] hdu 1217 Arbitrage (bellman_ford最短路，判断是否有正权回路或Floyed）
ArbitrageProblem DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example,原创 2014-07-15 16:41:51 · 2356 阅读 · 0 评论 -
[ACM] 最短路算法整理（bellman_ford , SPFA , floyed , dijkstra 思想，步骤及模板）
以杭电2544题目为例最短路Problem Description在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？ Input输入包括多组数据。每组数据第一行是两个原创 2014-07-15 16:14:33 · 3286 阅读 · 0 评论 -
[ACM] POJ 3259 Wormholes (bellman-ford最短路径，判断是否存在负权回路）
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 29971 Accepted: 10844DescriptionWhile exploring his many farms, Farmer John has discovered a原创 2014-07-14 21:06:33 · 2642 阅读 · 0 评论 -
[ACM] hdu 2544 最短路(dijkstra算法）
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25941 Accepted Submission(s): 11174Problem Description 在每年的校赛里，所有进入决赛的同学都会原创 2014-03-01 11:15:27 · 2365 阅读 · 0 评论