随笔分类 - 最短路
摘要：题目大意：给定你一个包含n个点m条边的无向图，现在最多在图中保留k条边，问怎么删除多的边，使得图中良好的节点数最多，求出保留在图中的边的数量和编号。 良好的节点定义为：删除某条边后该点到点1的最短距离不变。 思路：先求出所有点到点1的最短距离，之后再bfs一遍，若遍历到某一节点时的距离等于该点到点1
阅读全文
摘要：最短路算法简单模板 一.floyed算法 首先对于floyed算法来说就是最短路径的动态规划解法，时间复杂度为O（n^3） 适用于图中所有点与点之间的最短路径的算法，一般适用于点n较小的情况。 Floyed算法有三层循环，循环的层次先后顺序也是比较重要的，分别为k ，i，j；因为dis[k][i][
阅读全文
摘要：Description A county consists of n cities (labeled 1, 2, …, n) connected by some bidirectional roads. Each road connects a pair of distinct cities. A
阅读全文
摘要：Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want
阅读全文
摘要：Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than o
阅读全文
摘要：Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-
阅读全文
摘要：Description One 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 ≤
阅读全文
摘要：Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who t
阅读全文
摘要：Description Freddy 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 vis
阅读全文
摘要：题目链接：http://poj.org/problem?id=2387 题意：有n个城市点，m条边，求n到1的最短路径。n<=1000; m<=2000 就是一个标准的最短路模板。
阅读全文
摘要：P1462 通往奥格瑞玛的道路 题目背景 在艾泽拉斯大陆上有一位名叫歪嘴哦的神奇术士，他是部落的中坚力量 有一天他醒来后发现自己居然到了联盟的主城暴风城 在被众多联盟的士兵攻击后，他决定逃回自己的家乡奥格瑞玛 题目描述 在艾泽拉斯，有n个城市。编号为1,2,3,...,n。 城市之间有m条双向的公路
阅读全文
浙公网安备 33010602011771号