随笔分类 -  ACM--最短路

zoj 3946 Highway Project(最短路 + 优先队列)
摘要：Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the capital as fast as pos 阅读全文
posted @ 2016-04-25 19:57 zhaop 阅读(283) 评论(0) 推荐(0)
HD1599 find the mincost route(floyd + 最小环)
摘要：题目链接 题意：求最小环 第一反应时floyd判断，但是涉及到最少3个点，然后就不会了，又想的是 双联通分量，这个不知道为什么不对。 Floyd 判断 最小环 1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 #in 阅读全文
posted @ 2016-04-05 23:15 zhaop 阅读(174) 评论(0) 推荐(0)
POJ 2240Arbitrage（Floyd）
摘要：E -ArbitrageTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2240Appoint description:DescriptionArbitrage is ... 阅读全文
posted @ 2015-11-26 16:13 zhaop 阅读(162) 评论(0) 推荐(0)
POJ1860Currency Exchange(Bellman + 正权回路)
摘要：Currency ExchangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:23938Accepted:8678DescriptionSeveral currency exchange points are working in ou... 阅读全文
posted @ 2015-11-25 21:20 zhaop 阅读(187) 评论(0) 推荐(0)
POJ3259Wormholes（判断是否存在负回路）
摘要：WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:38300Accepted:14095DescriptionWhile exploring his many farms, Farmer John has discovere... 阅读全文
posted @ 2015-11-25 14:58 zhaop 阅读(199) 评论(0) 推荐(0)
POJ2387 Til the Cows Come Home(SPFA + dijkstra + BallemFord 模板)
摘要：Til the Cows Come Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 37662 Accepted: 12836 Description Bessie is out in the field and wan 阅读全文
posted @ 2015-11-24 20:13 zhaop 阅读(217) 评论(0) 推荐(0)
HD1385Minimum Transport Cost（Floyd + 输出路径）
摘要：Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9109Accepted Submission(s): ... 阅读全文
posted @ 2015-11-23 23:14 zhaop 阅读(267) 评论(0) 推荐(0)