Fuck,干

 我的这个题目老是过不了，一直Y

 

/*
ID: niepeng1
LANG: C
TASK: cowtour
*/
#include"stdio.h"
#include"math.h"
double longlink[200][200];
char    g[200][200];
double far[200]={0};
double x[200],y[200];
int n;
FILE *fin,*fout;
double min(double a,double b)
{
       if(a<b) return a;
       else return b;
}
double max(double a,double b)
{
       if(a>b) return a;
       else return b;
}
void read()
{
     fin=fopen("cowtour.in","r");
     fout=fopen("cowtour.out","w");
     int i,j,k;
     double detax,detay;
     fscanf(fin,"%d",&n);
     for(i=1;i<=n;i++)
      fscanf(fin,"%lf %lf",&x[i],&y[i]);
     for(i=1;i<=n;i++)
      for(j=1;j<=n;j++)
      {
       detax=x[j]-x[i];
       detay=y[j]-y[i];
       fscanf(fin,"%c",&g[i][j]);
       while(g[i][j]=='/0'||g[i][j]=='/n') fscanf(fin,"%c",&g[i][j]);
       g[i][j]-='0';
       if(g[i][j])
        longlink[i][j]=sqrt(detax*detax+detay*detay);
       else
        longlink[i][j]=999999999;
     
      }
    for(k=1;k<=n;k++)
     for(i=1;i<=n;i++)
      for(j=1;j<=n;j++)
      {
       //if(g[i][k]&&g[k][j]&&g[i][j])
        longlink[i][j]=min(longlink[i][k]+longlink[k][j],longlink[i][j]);
      }//到此为止大家一样
    for(i=1;i<=n;i++)
     for(j=1;j<=n;j++)
     {
      if(longlink[i][j]!=999999999&&i!=j)
       far[i]=max(far[i],longlink[i][j]);
     }//从i节点出发的最大值
}
int main()
{
    read();
    int i,j;
    double re=999999999,t;
    double detax,detay;
    for(i=1;i<=n;i++)
     for(j=1;j<=n;j++)
     {
       detax=x[j]-x[i];
       detay=y[j]-y[i];t=sqrt(detax*detax+detay*detay);
      if(longlink[i][j]==999999999&&i!=j)
      {
       re=min(re,far[i]+far[j]+t);
      }
     }
    /*for(i=1;i<=n;i++)
    {
     for(j=1;j<=n;j++)
      //fprintf(fout,"%d ",g[i][j]);
      fprintf(fout,"%lf ",longlink[i][j]);
     fprintf(fout,"/n");
    }   
    for(i=1;i<=n;i++)
    */
    //printf("%lf",longlink[6][6]);getch();
    for(i=1;i<=n;i++)
    {
     //fprintf(fout,"%lf/n",far[i]);   
     re=max(re,far[i]);
    }
    fprintf(fout,"%lf/n",re);return 0;
}