【USACO2-4-3】牛的旅行 Cow Tours floyd

原题

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cctype>
#define inf 0x3f3f3f3f
using namespace std;
struct node{int x,y;}a[1010];
double dis[1010][1010],l[1010],l1,l2=inf;
int n,m;
//计算两点之间的距离 
double cal(int p,int q){return sqrt((a[p].x-a[q].x)*(a[p].x-a[q].x)+(a[p].y-a[q].y)*(a[p].y-a[q].y));}
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++){
            char f=getchar();while(!isdigit(f))f=getchar();
            if (f-'0') dis[i][j]=cal(i,j);
            else 
                if (i!=j) dis[i][j]=inf;
        }
    for (int k=1;k<=n;k++)
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++) dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);//floyd 
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            if (dis[i][j]<inf){
                l[i]=max(l[i],dis[i][j]);//与当前点最远的点的距离 
                l1=max(l1,l[i]);//最大的牧场直径 
            }
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            if (dis[i][j]>=inf) l2=min(l[i]+cal(i,j)+l[j],l2);//枚举使直径最短的合并的点 
    printf("%.6f",max(l1,l2));
    return 0;
}