最短路
文章平均质量分 79
键盘崩坏
这个作者很懒,什么都没留下…
展开
-
HDU3790:最短路径问题(Dijkstra)
Problem Description 给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。 Input 输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为原创 2014-08-01 10:18:43 · 348 阅读 · 0 评论 -
HDU3631:Shortest Path(Floyd)
Problem Description When YY was a boy and LMY was a girl, they trained for NOI (National Olympiad in Informatics) in GD team. One day, GD team’s coach, Prof. GUO asked them to solve the following s原创 2014-08-07 17:49:24 · 263 阅读 · 0 评论 -
HDU1217:Arbitrage(SPFA)
Problem Description Arbitrage 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, suppose that 1 US原创 2014-08-01 14:50:13 · 277 阅读 · 0 评论 -
HDU2066:一个人的旅行(Dijkstra)
Problem Description 虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大原创 2014-07-31 23:17:05 · 400 阅读 · 0 评论 -
HDU1874:畅通工程续(Dijkstra/Floyd/SPFA)
Problem Description 某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。 现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。 Input 本题目包含多组数据,请处理到文件结束。原创 2014-07-31 10:17:27 · 386 阅读 · 0 评论 -
HDU:1317 XYZZY(SPFA处理正环+Flody判断点连通)
Problem Description It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment o原创 2014-08-06 23:00:22 · 408 阅读 · 0 评论 -
hdu2923
#include #include #include using namespace std; const int inf=999999999; int n,c,m; int tu[105][105]; char str[1005][100]; int cnt; mapmat; void Floyd() { int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n原创 2014-08-07 16:30:18 · 428 阅读 · 0 评论 -
HDU1595:find the longest of the shortest(Dijkstra)
Problem Description Marica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in the same city, she started preparing for the long journey.We kn原创 2014-08-06 16:31:08 · 370 阅读 · 0 评论 -
HDU1546:Idiomatic Phrases Game(Dijkstra)
Problem Description Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should bui原创 2014-08-07 13:27:25 · 348 阅读 · 0 评论 -
HDU2112:HDU Today(Dijkstra)
Problem Description 经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。 这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车原创 2014-08-01 08:37:14 · 286 阅读 · 0 评论 -
HDU2833:WuKong(Floyd 最大共同公共点)
Problem Description Liyuan wanted to rewrite the famous book “Journey to the West” (“Xi You Ji” in Chinese pinyin). In the original book, the Monkey King Sun Wukong was trapped by the Buddha for 500原创 2014-08-05 21:03:17 · 452 阅读 · 0 评论 -
HDU2807:The Shortest Path(矩阵乘法+快速矩阵比较+Floyd)
Problem Description There are N cities in the country. Each city is represent by a matrix size of M*M. If city A, B and C satisfy that A*B = C, we say that there is a road from A to C with distance原创 2014-08-05 22:59:49 · 385 阅读 · 0 评论 -
HDU1245:Saving James Bond(Floyd)
Problem Description This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the world's most famous spy, was captured by a group of drug dealers. He was sent to原创 2014-08-06 13:55:45 · 391 阅读 · 0 评论 -
HDU2680:Choose the best route(Dijkstra)
Problem Description One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city原创 2014-08-05 08:50:17 · 351 阅读 · 0 评论 -
HDU3339:In Action(Dijkstra+01背包)
Problem Description Since 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe. Nowadays,the crazy b原创 2014-08-05 09:54:02 · 415 阅读 · 0 评论 -
HDU1599:find the mincost route(Floyd最小无向环)
Problem Description 杭州有N个景区,景区之间有一些双向的路来连接,现在8600想找一条旅游路线,这个路线从A点出发并且最后回到A点,假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区,而且不能重复经过同一个景区。现在8600需要你帮他找一条这样的路线,并且花费越少越好。 Input原创 2014-08-05 11:17:21 · 387 阅读 · 0 评论 -
HDU1548:A strange lift(Dijkstra)
Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When原创 2014-08-01 11:52:16 · 311 阅读 · 0 评论 -
HDU1690:Bus System(Floyd)
Problem Description Because of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s原创 2014-08-07 20:02:18 · 298 阅读 · 0 评论