专题四 最短路练习
九羽-
日有所进,月有所变,终有所成。
展开
-
F - Wormholes POJ - 3259 (经典Bellman-Ford算法)
F - Wormholes POJ - 3259While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its d...原创 2019-06-05 19:48:31 · 313 阅读 · 0 评论 -
D - Silver Cow Party POJ - 3268(两次dijkstra)
D - Silver Cow Party POJ - 3268One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1…N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 10...原创 2019-06-03 19:42:01 · 284 阅读 · 0 评论 -
深入理解Bellman-Ford(SPFA)算法
深入理解Bellman-Ford(SPFA)算法推荐阅读原文:https://blog.csdn.net/u011893609/article/details/81232124#include <iostream>#include <queue>#include <cstring>#define inf 0x3f3f3fusing namesp...转载 2019-06-03 21:50:22 · 830 阅读 · 0 评论 -
J - Invitation Cards POJ - 1511(邻接表+两次堆优化的dijkstra)
In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They ...原创 2019-06-10 20:16:53 · 206 阅读 · 0 评论 -
K - Candies POJ - 3159(邻接表+堆优化的dijstra)
During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the...原创 2019-06-10 21:58:34 · 219 阅读 · 0 评论 -
最短路Spfa算法(邻接表+邻接矩阵)
一个我认为比较好的Spfa模板(使用邻接表和队列实现)推荐阅读原文:https://blog.csdn.net/u011646353/article/details/45771785/spfa,邻接矩阵推荐阅读原文:https://blog.csdn.net/ZCY19990813/article/details/88580828...转载 2019-06-04 20:26:02 · 388 阅读 · 0 评论 -
E - Currency Exchange POJ - 1860( 找正回路 + 反向Bellman_ford)
E - Currency Exchange POJ - 1860Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations on...原创 2019-06-04 21:05:04 · 226 阅读 · 0 评论 -
邻接表+堆优化的dijkstra (最好用的最短路代码)
图结构练习——最短路径Problem Description给定一个带权无向图,求节点1到节点n的最短路径。Input输入包含多组数据,格式如下。第一行包括两个整数n m,代表节点个数和边的个数。(n<=100)剩下m行每行3个正整数a b c,代表节点a和节点b之间有一条边,权值为c。Output每组输出占一行,仅输出从1到n的最短路径权值。(保证最短路径存在)Sam...原创 2019-06-11 21:21:10 · 498 阅读 · 0 评论 -
F - Wormholes(SPFA+邻接矩阵)
F - Wormholes(SPFA+邻接矩阵)While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its ...原创 2019-08-20 16:34:16 · 345 阅读 · 0 评论 -
F - Wormholes(SPFA+邻接表)
F - Wormholes(SPFA+邻接表)While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its d...原创 2019-09-02 12:28:01 · 187 阅读 · 0 评论 -
I - Arbitrage POJ - 2240(找正回路+反向bellman)
I - Arbitrage POJ - 2240Arbitrage 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 ...原创 2019-06-09 21:13:54 · 134 阅读 · 0 评论 -
H - Cow Contest POJ - 3660(Floyd)
H - Cow Contest POJ - 3660N (1 ≤ N ≤ 100) cows, conveniently numbered 1…N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain cons...原创 2019-06-09 20:32:56 · 169 阅读 · 0 评论 -
P - The Shortest Path in Nya Graph HDU - 4725(邻接表dijkstra)
推荐阅读原文:https://blog.csdn.net/zcmartin2014214283/article/details/52775288P - The Shortest Path in Nya Graph HDU - 4725This is a very easy problem, your task is just calculate el camino mas corto en...转载 2019-06-14 19:06:20 · 150 阅读 · 0 评论 -
最短路 dijstra算法
最短路 dijstra算法先了解原理:https://www.cnblogs.com/jason2003/p/7222182.html看题:Problem Description给定一个带权无向图,求节点1到节点n的最短路径。Input输入包含多组数据,格式如下。第一行包括两个整数n m,代表节点个数和边的个数。(n<=100)剩下m行每行3个正整数a b c,代表节...原创 2019-05-31 20:20:19 · 258 阅读 · 0 评论 -
A - Til the Cows Come Home POJ - 2387(经典dijstra)
A - Til the Cows Come Home POJ - 2387Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs...原创 2019-05-31 21:09:21 · 278 阅读 · 0 评论 -
B - Frogger POJ - 2253(进阶最短路,青蛙跳跳跳)
B - Frogger POJ - 2253Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty ...原创 2019-05-31 21:59:43 · 646 阅读 · 0 评论 -
C - Heavy Transportation POJ - 1797(最长路)
C - Heavy Transportation POJ - 1797BackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there r...原创 2019-06-01 20:26:18 · 291 阅读 · 1 评论 -
四种最短路算法的比较
推荐阅读原文:https://blog.csdn.net/mashiro_ylb/article/details/78289790结论是:Dijkstra算法,不能处理存在负边权的情况,侧重对点的处理,适用于:稠密图。Floyed-Warshall算法,只有数据规模较小且时空复杂度都允许时才可以使用。Bellman-Ford算法,可以求出存在负边权情况下的最短路径,但无法解决存在负权回路...转载 2019-06-01 20:42:38 · 1218 阅读 · 0 评论 -
M - 昂贵的聘礼 POJ - 1062
https://www.cnblogs.com/hollowstory/p/5667261.html中文题面,比较好理解,就不说明了由于最终要换到1号物品,第一反应是逆向求1号物品换到其它物品的花费,再转换成换到1号物品的花费,但是由于交换物品时的等级限制,这样处理会很麻烦于是想到,假设一个0号物品,求由0号物品换到1号物品的花费关于等级限制,无法确定酋长是否是最高等级,于是可以将0号物品...转载 2019-06-13 15:58:39 · 172 阅读 · 0 评论 -
N - Tram POJ - 1847(模拟最短路)
N - Tram POJ - 1847Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out...原创 2019-06-13 20:06:49 · 215 阅读 · 0 评论 -
dijkstra的堆优化(最简版本)
dijkstra的堆优化(最简版本)先了解不用堆优化的dijkstra:https://blog.csdn.net/weixin_43828245/article/details/90722389推荐视频讲解(代码是Python写的,重点听思路):https://www.bilibili.com/video/av25829980了解c++优先队列:https://blog.csdn.ne...原创 2019-06-02 21:42:51 · 1134 阅读 · 0 评论 -
G - MPI Maelstrom POJ - 1502(dijkstra)
G - MPI Maelstrom POJ - 1502BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. ...原创 2019-06-09 19:56:47 · 191 阅读 · 0 评论 -
dijkstra输出最优路径
dijkstra输出最优路径众所周知, dijkstra是用来求最短路径长度的算法。 那么如果题意要求输出所有的最短路径该如何输出呢?容易想到的是用前驱数组来存, 但最短路的走法可能不唯一,所有这里用 二维前驱数组 + DFS 来实现。以下转载自:斐斐のBlog»多条最短路径问题再探-使用Dijkstra+DFS选出并输出最优路径0x01、Dijkstra生成前...翻译 2019-09-06 20:47:51 · 859 阅读 · 0 评论