不多说了 分治
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define INF 10000000000.0
struct node
{
double x,y;
}p[100000+1];
bool cmp1(node i,node j)
{
if(i.x==j.x) return i.y<j.y;
return i.x<j.x;
}
bool cmp2(node i,node j)
{
return i.y<j.y;
}
int n;
double Distance(node i,node j)
{
double m=(i.x-j.x)*(i.x-j.x)+(i.y-j.y)*(i.y-j.y);
return sqrt(m);
}
double ClosestPoints(node p[],int s,int t)
{
int mid=(t+s)>>1;
int num=t-s+1;
if(num<2) return INF;
if(num==2) return Distance(p[s],p[t]);
double d=min(ClosestPoints(p,s,mid),ClosestPoints(p,mid+1,t));
node pl[t-s+2];
int num1=0;
for(int i=mid;i>=s;i--)
{
if(p[mid].x-p[i].x<d) pl[num1].x=p[i].x,pl[num1++].y=p[i].y;
else break;
}
for(int i=mid+1;i<=t;i++)
{
if(p[i].x-p[mid].x<d) pl[num1].x=p[i].x,pl[num1++].y=p[i].y;
else break;
}
sort(pl,pl+num1,cmp2);
double d1=INF;
for(int i=0;i<num1;i++)
for(int j=i+1;j<num1;j++)
{
if(pl[j].y-pl[i].y>=d) break;
double d2=Distance(pl[i],pl[j]);
d1=min(d2,d1);
}
return min(d1,d);
}
int main()
{
while(scanf("%d",&n)&&n)
{
for(int i=0;i<n;i++)
{
scanf("%lf%lf",&p[i].x,&p[i].y);
}
sort(p,p+n,cmp1);
double ans=ClosestPoints(p,0,n-1);
printf("%.2lf\n",ans/2);
}
return 0;
}