UVa 10048 Audiophobia / floyd变形

给你q个询问 使1条路中最大边尽量小 最大最小化 floyd变形 存的是最大边值

#include <stdio.h>
#include <algorithm>
using namespace std;
const int MAX = 110;
const int INF = 999999999;
int a[MAX][MAX];
int n,m,q;
void floyd()
{
	int i,j,k;
	for(k = 1; k <= n; k++)
	{
		for(i = 1;i <= n; i++)
		{
			for(j = 1;j <= n; j++)
			{
				if(a[i][k] != INF && a[k][j] != INF && a[i][j] > max(a[i][k] ,a[k][j]))
					a[i][j] = max(a[i][k] ,a[k][j]);
			}
		}
	}
}
int main()
{
	int i,j,x,y,z,cas = 0;
	while(scanf("%d %d %d",&n,&m,&q),n||m||q)
	{
		for(i = 1;i <= n; i++)
		{
			for(j = 1;j <= n; j++)
			{
				if(i == j)
					a[i][j] = 0;
				else
					a[i][j] = INF;
			}
		}
		while(m--)
		{
			scanf("%d %d %d",&x,&y,&z);
			a[x][y] = a[y][x] = z;
		}
		floyd();
		if(cas++)
			puts("");
		printf("Case #%d\n",cas);
		while(q--)
		{
			scanf("%d %d",&x,&y);
			if(a[x][y] != INF)
				printf("%d\n",a[x][y]);
			else
				puts("no path");
		}
	}
	return 0;
}