Audiophobia UVA - 10048

UVA-10048

题目：题目大意:给定一无向图，每条边都有一个权值，现在给你起点和终点，要求你找出起点到终点途经的边的最大值，要求这个值尽量小，到不了输出no path。

思路：Floyd问题。

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<sstream>
#include<map>
#include<stack>
#include<queue>
using namespace std;
const int INF = 252645135;
int n_p,n_e,Q,kase = 0;
int G[200][200];
int main(){
    while(scanf("%d%d%d",&n_p,&n_e,&Q)==3){
        memset(G, 15, sizeof(G));
        if(n_p==0&&n_e==0&&Q==0) break;
        else if(kase) cout<<endl;
        printf("Case #%d\n",++kase);
        for(int i = 1;i<=n_e;i++){
            int start,end,len;
            scanf("%d%d%d",&start,&end,&len);
            G[start][end] = len;
            G[end][start] = len;
        }
        for(int k = 1;k<=n_p;k++){
            for(int i = 1;i<=n_p;i++){
                for(int j = 1;j<=n_p;j++){
                    if(G[i][k]==INF||G[k][j]==INF) continue;
                    G[i][j] = min(G[i][j],max(G[i][k],G[k][j]));
                    G[j][i] = G[i][j];
                }
            }
        }
        for(int i = 1;i<=Q;i++){
            int a,b;
            cin>>a>>b;
            if(G[a][b] == INF) printf("no path\n");
            else printf("%d\n",G[a][b]);
        }
    }
    return 0;
}