POJ 3615 Cow Hurdles Floyd算法的变体

http://poj.org/problem?id=3615

题意：找一条路径，使得这条路径上最大的两节点权值在所有可能路径中最短，并求出这个值

实际上就是Floyd算法，只不过这里不是求的最短路径长度，而是路径上两相邻节点之间的最大距离

Cow Hurdles

Time Limit:1000MS		Memory Limit:65536K

Description

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 hasN(1 ≤N≤ 300) stations, conveniently labeled 1..N. A set ofM(1 ≤M≤ 25,000) one-way paths connects pairs of stations; the paths are also conveniently labeled 1..M. Pathitravels from stationS_ito stationE_iand contains exactly one hurdle of heightH_i(1 ≤H_i≤ 1,000,000). Cows must jump hurdles in any path they traverse.

The cows haveT(1 ≤T≤ 40,000) tasks to complete. Taskicomprises two distinct numbers,A_iandB_i(1 ≤A_i≤N; 1 ≤B_i≤N), which connote that a cow has to travel from stationA_ito stationB_i(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 fromA_itoB_i. 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, andT
* Lines 2..M+1: Linei+1 contains three space-separated integers:S_i,E_i, andH_i
* LinesM+2..M+T+1: Linei+M+1 contains two space-separated integers that describe task i:A_iandB_i

Output

* Lines 1..T: Lineicontains the result for taskiand 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

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

Sample Output

4
8
-1

/* Author : yan
 * Question : POJ 3615 Cow Hurdles
 * Date && Time : Sunday, January 23 2011 09:39 PM
 * Compiler : gcc (Ubuntu 4.4.3-4ubuntu5) 4.4.3
*/
#include<stdio.h>
#define MAXN 301
#define INF 999999
int map[MAXN][MAXN];

int main()
{
	//freopen("input","r",stdin);
	int n,m,t;
	int i,j,k;
	int cache1,cache2,weight;
	scanf("%d %d %d",&n,&m,&t);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			if(i==j) map[i][j]=0;
			else map[i][j]=INF;
		}
	}
	for(i=0;i<m;i++)
	{
		scanf("%d %d %d",&cache1,&cache2,&weight);
		map[cache1][cache2]=weight;
	}
	int tmp;
	for(k=1;k<=n;k++)//注意循环的次序
	{
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				tmp=map[i][k]>map[k][j]?map[i][k]:map[k][j];//这个地方需要仔细想想
				if(map[i][j]>tmp) map[i][j]=tmp;
			}
		}
	}
	for(i=0;i<t;i++)
	{
		scanf("%d %d",&cache1,&cache2);
		printf("%d/n",map[cache1][cache2]!=INF?map[cache1][cache2]:-1);
	}

	return 0;
}