两点最短距离2.cpp

来自「各种算法」· C++ 代码 · 共 30 行

#include "stdio.h"
#include "math.h"
//求出距离最短的两点
  double dis(double x1,double x2,double y1,double y2)
     { double c;
       c=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
       return c;
     } 
  main()
 { int i,j,n;
   double t,a[100],b[100],m;
    scanf("%d",&n);
    for (i=0;i<n;i++)
       { scanf("%lf%lf",&a[i],&b[i]);
        }
    m=dis(a[0],a[1],b[0],b[1]);
    for (i=0;i<n-1;i++)
       for (j=i+1;j<n;j++)
          { t=dis(a[i],a[j],b[i],b[j]); 
            m=(t<m)?t:m; }
    printf("%.3lf\n",m);
 }