图论 - 最短路
文章平均质量分 81
i逆天耗子丶
这个作者很懒,什么都没留下…
展开
-
NYOJ - 115 - 城市平乱 ( 最短路 Dijkstra )
描述南将军统领着N个部队,这N个部队分别驻扎在N个不同的城市。他在用这N个部队维护着M个城市的治安,这M个城市分别编号从1到M。现在,小工军师告诉南将军,第K号城市发生了暴乱,南将军从各个部队都派遣了一个分队沿最近路去往暴乱城市平乱。现在已知在任意两个城市之间的路行军所需的时间,你作为南将军麾下最厉害的程序员,请你编写一个程序来告诉南将军第一个分队到达叛乱城市所需的原创 2016-12-21 14:55:50 · 468 阅读 · 0 评论 -
PAT - 甲级 - 1018. Public Bike Management (30)(Dijkstra+DFS)
There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the原创 2017-10-30 17:56:38 · 382 阅读 · 0 评论 -
PAT - 甲级 - 1003. Emergency (25)(Dijkstra)
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l原创 2017-10-29 22:04:25 · 298 阅读 · 0 评论 -
PAT - 甲级 1111. Online Map (30)(Dijkstra+DFS)
Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths to your user: one is the shortest, and the other is the fastest. It is g原创 2017-11-01 17:02:33 · 403 阅读 · 0 评论 -
PAT - 甲级 - 1030. Travel Plan (30) (Dijkstra+DFS)
A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path b原创 2017-10-31 18:45:25 · 310 阅读 · 0 评论 -
PAT - 甲级 - 1072. Gas Station (30)(Dijkstra)
A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all the hou原创 2017-11-02 14:08:47 · 419 阅读 · 0 评论 -
Nuc - 00005:兔子与樱花 (Floyd求最短路+路径记录)
题目描述:总时间限制: 1000ms 内存限制: 65535kB描述很久很久之前,森林里住着一群兔子。有一天,兔子们希望去赏樱花,但当他们到了上野公园门口却忘记了带地图。现在兔子们想求助于你来帮他们找到公园里的最短路。输入输入分为三个部分。第一个部分有P+1行(P第二个部分有Q+1行(Q第三个部分有R+1行(R输出输出有R行,分别表示每个路线最短原创 2017-03-22 22:06:09 · 1716 阅读 · 0 评论 -
UVa - 247 - Calling Circles ( Floyd 传递闭包 )
题目大意:题目中给出 n 的人的名字,m组关系,表示前者给后者打电话 。如果两个人互相打过电话(直接或者间接),那么这两个人在一个集合。现在要求出所有集合中的人,输出格式看输出实例。题目思路:设d[ i ] [ j ] 表示 i 和 j 通话过,如果 d[ i ] [ j ] && d[ j ] [ i ] 那么说明 i 和 j 属于同一个集合。d[ i ][ j ]原创 2016-12-19 21:01:19 · 605 阅读 · 0 评论 -
UVa - 10048 - Audiophobia ( Floyd 变形 )
题目大意:从a城市到b城市的路径中,尽可能让一路上的最大噪音最小。题目思路:设d [ i ][ j ]表示 i 到 j 的最大噪音的最小值。 那么d [ i ][ j ] = min( d[ i ][ j ] ,max( d [ i ][ k ] , d [ k ][ j ]) );#include#include#include#define N 105原创 2016-12-19 22:12:38 · 557 阅读 · 0 评论 -
PAT - 甲级 - 1087. All Roads Lead to Rome (30)(Dijkstra+DFS+路径)
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.Input Specification:E原创 2017-11-03 11:18:13 · 442 阅读 · 0 评论