[floyd][最小瓶颈路]Cow Hurdles POJ3615

Farmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want to be able to use as little energy as possible to jump over the hurdles.

Obviously, it is not very difficult for a cow to jump over several very short hurdles, but one tall hurdle can be very stressful. Thus, the cows are only concerned about the height of the tallest hurdle they have to jump over.

The cows' practice room has N (1 ≤ N ≤ 300) stations, conveniently labeled 1..N. A set of M (1 ≤ M ≤ 25,000) one-way paths connects pairs of stations; the paths are also conveniently labeled 1..M. Path i travels from station Si to station Ei and contains exactly one hurdle of height Hi (1 ≤ Hi ≤ 1,000,000). Cows must jump hurdles in any path they traverse.

The cows have T (1 ≤ T ≤ 40,000) tasks to complete. Task i comprises two distinct numbers, Ai and Bi (1 ≤ Ai ≤ N; 1 ≤ Bi ≤ N), which connote that a cow has to travel from station Ai to station Bi (by traversing over one or more paths over some route). The cows want to take a path the minimizes the height of the tallest hurdle they jump over when traveling from Ai to Bi . Your job is to write a program that determines the path whose tallest hurdle is smallest and report that height.
　

Input

* Line 1: Three space-separated integers: N, M, and T
* Lines 2..M+1: Line i+1 contains three space-separated integers: Si , Ei , and Hi
* Lines M+2..M+T+1: Line i+M+1 contains two space-separated integers that describe task i: Ai and Bi

Output

* Lines 1..T: Line i contains the result for task i and tells the smallest possible maximum height necessary to travel between the stations. Output -1 if it is impossible to travel between the two stations.

Sample

Input	Output
5 6 3 1 2 12 3 2 8 1 3 5 2 5 3 3 4 4 2 4 8 3 4 1 2 5 1	4 8 -1

题意： n个点、m条边构成带权有向图，q组询问，每次询问输出两点间所有路径最大边的最小值。

分析： 点数很小，所以可以直接floyd跑最短路变形，定义dis[i][j]含义为从i出发到j点所有路径最大边的最小值，考虑状态转移方程，根据floyd算法，当前已知的是前k-1个点可能作为中间点时的dis值，要得到的是前k个点可能作为中间点的dis值，实际上就是两种情况，要么经过第k个点，要么不经过第k个点，因此状态转移方程就是dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j]))，dis初始值就是0个中间点的情况，也就是初始的地图。

具体代码如下：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#define inf 0x3f3f3f3f
using namespace std;
//点a到点b所有路径的最大边最小值 
int n, m, q, dis[305][305];

signed main()
{
	cin >> n >> m >> q;
	for(int i = 1; i <= m; i++)
	{
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		dis[u][v] = max(dis[u][v], w);
	}
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			if(i != j && dis[i][j] == 0)
				dis[i][j] = inf;
	for(int k = 1; k <= n; k++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j]));
	for(int i = 1; i <= q; i++)
	{
		int u, v;
		scanf("%d%d", &u, &v);
		if(dis[u][v] != inf) printf("%d\n", dis[u][v]);
		else puts("-1");
	}
    return 0;
}