图论--最短路
exmy
Less is more, and more is less.
展开
-
PAT--1003. Emergency (最短路)
1003. Emergency题解最短路,要维护两个数据,最短路的条数以及救援队的最大个数。#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <queue>using namespace std;const int maxn = 500 + 3;const int inf原创 2016-09-29 23:08:04 · 416 阅读 · 0 评论 -
poj--2449 Remmarguts' Date(k短路)
Remmarguts’ Date题解求s到t的第k短路的长度。 SPFA + A*算法。A*算法通过一个估价函数f(h)来估计图中的当前点p到终点的距离,并由此决定它的搜索方向,当这条路径失败时,它会尝试其他路径。估价函数 = 当前值+当前位置到终点的距离,即f(p)=g(p)+d(p)f(p) = g(p)+d(p) 其中,g(p)g(p)为当前从s到p所走的路径长度,d(p)d(p)为从原创 2016-09-16 20:32:56 · 413 阅读 · 0 评论 -
UVa--10048 Audiophobia(floyd)
UVa 10048题意求图中两点最大噪声值最小的路径。题解Floyd算法变形一下: d[i][j]=min(d[i][j],max(d[i][k],d[k][j]))d[i][j] = min(d[i][j], max(d[i][k], d[k][j]))#include <bits/stdc++.h>using namespace std;const int maxn = 105;const原创 2016-03-29 17:32:16 · 422 阅读 · 0 评论 -
nyoj--115 城市平乱(最短路径)
题解计算这n个点到Q的最短路径,取最小值。 Floyd 会TLE. 没优化的Dijkstra。#include <iostream>#include <cstdio>#include <vector>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1005;const int inf原创 2016-03-11 20:18:36 · 565 阅读 · 0 评论 -
hdoj--2112 HDU Today(最短路径)
HDOJ 2112题解一个求最短路径的问题,与一般的最短路问题有所不同的是,此题图的结点是字符串。所以需要特殊处理。 一种策略是将每个字符串映射为一个整数,转化为普通的最短路问题。 还有一种是使用map,思想仍然是映射。 需要注意的一点是,目的地有可能是公交车到不了的,WA一次。#include <iostream>#include <cstdio>#include <map>#incl原创 2016-02-26 22:29:20 · 551 阅读 · 0 评论 -
PAT--1030. Travel Plan(最短路)
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 be原创 2017-08-30 23:17:58 · 362 阅读 · 0 评论 -
PAT--1111. Online Map
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原创 2018-01-20 14:52:45 · 370 阅读 · 0 评论 -
PAT--1087. All Roads Lead to Rome
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:Eac原创 2018-01-20 20:18:19 · 681 阅读 · 0 评论