poj 2253（floyd任意两点间最短路径问题）

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
using namespace std;
int n;
double data[205][205],x[205],y[205];
void floyd(){
    int i,j,k;
    for(k=1;k<=n;k++){
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                // 每个通路的最长边中的最小边
                data[i][j] = min(data[i][j],max(data[i][k],data[k][j]));
            }
        }
    }
}
int main(){
    int i,j,kase=0;
    while(scanf("%d",&n)==1&&n){
        for(i=1;i<=n;i++){
            scanf("%lf%lf",&x[i],&y[i]);
        }
        for(i=1;i<=n;i++){
            for(j=i+1;j<=n;j++){
                data[i][j] = data[j][i] = sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
            }
        }
        floyd();
        printf("Scenario #%d\n",++kase);
        printf("Frog Distance = %.3lf\n\n",data[1][2]);
    }
    return 0;
}