★1007 给定一些点求两点之间的最短距离

 Problem Description

Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a time. On the other hand, to make the game look more attractive, the ring is designed to have the largest radius. Given a configuration of the field, you are supposed to find the radius of such a ring.

Assume that all the toys are points on a plane. A point is encircled by the ring if the distance between the point and the center of the ring is strictly less than the radius of the ring. If two toys are placed at the same point, the radius of the ring is considered to be 0.

 

 

Input

The input consists of several test cases. For each case, the first line contains an integer N (2 <= N <= 100,000), the total number of toys in the field. Then N lines follow, each contains a pair of (x, y) which are the coordinates of a toy. The input is terminated by N = 0.

 

 

Output

For each test case, print in one line the radius of the ring required by the Cyberground manager, accurate up to 2 decimal places.

 

 

Sample Input

2
0 0
1 1
2
1 1
1 1
3
-1.5 0
0 0
0 1.5
0

 

 

Sample Output

0.71
0.00
0.75

就是给定一些点

在这些点中画一个圆，使得只经过点一次并且尽量让圆大一点

也就是给出一堆点  求出求出两点之间的最短距离 就是这个圆的直径

这里用递归实现

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cstdio>
using namespace std;
const int N=1000000;
const double eps=0.00001;  //精度
typedef struct TYPE
{
    double x,y;
    int index;
} Point;                  //存每点的坐标和索引值
Point a[N],b[N],c[N];
inline double min(double p,double q)
{
    return p>q?q:p;
}
double dis(Point p,Point q)
{
    double x1=p.x-q.x,y1=p.y-q.y;
    return sqrt(x1*x1+y1*y1);
}
int merge(Point p[],Point q[],int s,int m,int t)  //将数组q保存到p，且对y升序排序
{
    int i,j,k;
    for(i=s,j=m+1,k=s;i<=m&&j<=t;)
    {
        if(q[i].y>q[j].y)
            p[k++]=q[j++];
        else
            p[k++]=q[i++];
    }
    while(i<=m)
        p[k++]=q[i++];
    while(j<=t)
        p[k++]=q[j++];
    memcpy(q+s,p+s,(t-s+1)*sizeof(p[0]));
    return 0;
}
double closest(Point a[],Point b[],Point c[],int p,int q)
{
    if(q-p==1)
        return dis(a[p],a[q]);
    else if(q-p==2)
    {
        double x1=dis(a[p],a[q]);
        double x2=dis(a[p+1],a[q]);
        double x3=dis(a[p],a[p+1]);
        if(x1<x2&&x1<x3)
            return x1;
        else if(x2<x3)
            return x2;
        else
            return x3;
    }
    int m=(p+q)/2;
    int i,j,k;
    double d1,d2;
    for(i=p,j=p,k=m+1;i<=q;i++)
        if(b[i].index<=m)
            c[j++]=b[i];    //数组左半部分保存划分的左部，对y升序的
        else
            c[k++]=b[i];    //数组右半部分保存划分的右部，对y升序的
    d1=closest(a,c,b,p,m);
    d2=closest(a,c,b,m+1,q);
    double dm=min(d1,d2);
    merge(b,c,p,m,q);      //将数组c保存到b，且对y升序的
    for(i=p,k=p;i<=q;i++)
        if(fabs(b[i].x-b[m].x)<dm)
            c[k++]=b[i];    //将离划分线b[m].x距离不超过dm的部分保存到数组c
    for(i=p;i<k;i++)
        for(j=i+1;j<k&&c[j].y-c[i].y<dm;j++)
        {
            double temp=dis(c[i],c[j]);
                if(temp<dm)
                    dm=temp;
        }
    return dm;
}
int cmp_x(const void *p,const void *q)      //按x升序排序
{
    double temp=((Point*)p)->x-((Point*)q)->x;
    if(temp>0)
        return 1;
    else if(fabs(temp)<eps)
        return 0;
    else
        return -1;
}
int cmp_y(const void *p,const void *q)    //按y升序排序
{
    double temp=((Point*)p)->y-((Point*)q)->y;
    if(temp>0)
        return 1;
    else if(fabs(temp)<eps)
        return 0;
    else
        return -1;
}
int main()
{
    int n,i;
    double d;
    while(scanf("%d",&n)!=EOF&&n)
    {
        for(i=0;i<n;i++)
            scanf("%lf %lf",&(a[i].x),&(a[i].y));
        qsort(a,n,sizeof(a[0]),cmp_x);  //对a按x升序排序
        for(i=0;i<n;i++)
            a[i].index=i;
        memcpy(b,a,n*sizeof(a[0]));
        qsort(b,n,sizeof(b[0]),cmp_y);  //对b按y升序排序
        d=closest(a,b,c,0,n-1);          //求最近点对的距离
        printf("%.2lf/n",d/2);          
    }
    return 0;
}