hdu1007求最近点对(分治法)

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<cstdlib>
using namespace std;
#define ll long long
#define cl(a,b) memset(a,b,sizeof(a))
#define N 50005
#define MAXN 100005
typedef pair<double, double> p;//first保存x点坐标  second保存y点坐标  
const int inf=0x3f3f3f3f;
const int INF=100000000;
int n;
p a[100005];
bool cmp(p a,p b)//按y归并排序
{
    return a.second<b.second;
}
double closest_pair(p *a,int n)
{
    if(n<=1)return inf;
    int m=n/2;
    double x=a[m].first;
    double d=min(closest_pair(a,m),closest_pair(a+m,n-m));
    inplace_merge(a,a+m,a+n,cmp);
    vector<p>b;//将到直线的距离小于d的顶点加入
    for(int i=0;i<n;i++)
    {
        if(fabs(a[i].first-x)>=d)continue;
        for(int j=0;j<b.size();j++)
        {
            double dx=a[i].first-b[b.size()-j-1].first;
            double dy=a[i].second-b[b.size()-j-1].second;
            if(dy>=d)break;
            d=min(d,sqrt(dx*dx+dy*dy));
        }
        b.push_back(a[i]);
    }
    return d;
}
void solve()
{
    sort(a,a+n);//按x坐标排序

    printf("%.2lf\n",closest_pair(a,n)/2);
}
int main()
{
    while(~scanf("%d",&n))
    {
        if(n==0)break;
        for(int i=0;i<n;i++)
        {
            scanf("%lf %lf",&a[i].first,&a[i].second);
        }
        solve();
    }
    return 0;
}