Poj 2253 Frogger

1WA于最小生成树改用floyd

2WA于%.3lf

3PE于没有数据间回车

4AC

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define MAX 210
#define INF 1e20
double G[MAX][MAX];
double x[MAX],y[MAX];
double dis(int p,int q){
    double xx=x[p]-x[q];
    double yy=y[p]-y[q];
    return sqrt(xx*xx+yy*yy);
    }
int main(){
    int n;int z=0;
    while(scanf("%d",&n)!=EOF&&n){
        int i,j,k;
        for(i=1;i<=n;i++){
            scanf("%lf%lf",&x[i],&y[i]);
            for(j=1;j<=i;j++)G[j][i]=G[i][j]=dis(i,j);
            }
        for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){
            G[i][j]=min(G[i][j],max(G[i][k],G[k][j]));
            }
        printf("Scenario #%d\n",++z);
        printf("Frog Distance = ");
        printf("%.3f\n\n",G[1][2]);
        }
    return 0;
    }