分治 求点对最短距离 hdu 1007 Quoit Design

#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

struct node
{
    double x;
    double y;
} s[100001];
int A[100001];

bool cmp( node a, node b )
{
    return a.x<b.x;
}
bool cmpy( int a, int b )
{
    return s[a].y<s[b].y;
}

double dis( node a, node b )
{
    return sqrt( ( a.x-b.x )*( a.x-b.x )+( a.y-b.y )*( a.y-b.y ) );
}

double Binarysearch( int l, int r )
{
    if( l+1==r )
        return dis( s[l], s[r] );
    if( l+2==r )
        return min( min( dis(s[l], s[l+1]), dis( s[l], s[r] ) ), dis( s[l+1], s[r] ) );

    int mid=( l+r )/2;
    double ans=min( Binarysearch( l, mid ), Binarysearch( mid+1, r ) );

    int i, j, cnt=0;
    for( i=l;i<=r;i++ )
    if( fabs( s[i].x-s[mid].x )<ans )  
    A[cnt++]=i;
    sort( A, A+cnt, cmpy );
    for( i=0;i<cnt;i++ )
    for( j=i+1;j<cnt;j++ )
    {
        if( s[A[j]].y-s[A[i]].y>=ans )
            break;
        ans=min( dis( s[A[i]], s[A[j]] ), ans );
    }
    return ans;
}

int main()
{
    int i, j, k;
    int n, m;

    while( scanf( "%d", &n ), n )
    {
        for( i=0;i<n;i++ )
            scanf( "%lf%lf", &s[i].x, &s[i].y );
        sort( s, s+n, cmp );
        printf( "%.2f\n", Binarysearch( 0, n-1 )/2 );
    }
    return 0;
}