floyed最短路+uva10803

距离小于10的可以走，距离大的初始化为INF，求最短路里最长的。

下面是代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const double INF=100000000000;
struct coord
{
    int x,y;
}down[105];
double grid[105][105];
int n;
void init()
{
    memset(grid,0,sizeof(grid));
}
double dist(coord a,coord b)
{
    double ans=sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
    if(ans<=10) return ans;
    else return 0;
}
void add_edge(int i)
{
    double t;
    for(int j=0;j<i;j++)
    if((t=dist(down[j],down[i]))!=0)
    grid[i][j]=grid[j][i]=t;
    else grid[i][j]=grid[j][i]=INF;
}
void floyed(int cas)
{
    for(int k=0;k<n;k++)
    {
        for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
            if(grid[i][k]>0.0&&grid[k][j]>0.0)
            grid[i][j]=min(grid[i][k]+grid[k][j],grid[i][j]);
        }
    }
    double max1=0;
    bool flag=true;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(i==j) continue;
            if(fabs(grid[i][j]-INF)<=1e-9)
            {
                flag=false;
                break;
            }
            max1=max(max1,grid[i][j]);
        }
        if(!flag) break;
    }
    printf("Case #%d:\n",cas);
    if(!flag) cout<<"Send Kurdy"<<endl;
    else printf("%.4lf\n",max1);
    cout<<endl;
}
int main()
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
    #endif
    int t;
    cin>>t;
    for(int cas=1;cas<=t;cas++)
    {
        cin>>n;
        init();
        for(int i=0;i<n;i++)
        {
            cin>>down[i].x>>down[i].y;
            add_edge(i);
        }
        floyed(cas);
    }
    return 0;
}