套圈（C++）

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 encirc1led 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.

---

样例

输入（1）

4
0 3
3 2
4 0
7 1
0

输出（1）

1.12

代码

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAX 100005
 
struct p{
	double x,y;
}pt[MAX]; 
 
double dd(int a,int b)
{
	return sqrt(pow(pt[a].x-pt[b].x,2.0)+pow(pt[a].y-pt[b].y,2.0));
} 
 
double min(double a,double b)
{
	return a<b?a:b;
}
 
bool cmp1(const p &a,const p &b)
{
	if(a.x==b.x) return a.y<b.y;
	else return a.x<b.x;
}
 
bool cmp2(const int &a,const int &b)
{
	return pt[a].y<pt[b].y;
}
 
int record[MAX];
 
double cpair(int st,int ed)
{
	double d;
	if(st==ed-1) return dd(st,ed);
	else if(st==ed-2)
	{
		d=min(min(dd(st,ed),dd(st,ed-1)),dd(ed-1,ed));
		return d;
	}
	else
	{
		int md=(st+ed)/2;
		double d1=cpair(st,md),d2=cpair(md+1,ed);
		d=min(d1,d2);
		int t=0;
		for(int i=st;i<=ed;i++)
		{
			if(fabs(pt[md].x-pt[i].x)<=d) record[t++]=i;
		}
		sort(record,record+t,cmp2); //将检测区间的点的横坐标大小编号按其纵坐标大小排列起来 
		for(int i=0;i<t;++i)
		{
			for(int j=i+1;j<t && pt[record[j]].y-pt[record[i]].y<d ; ++j)
			{
				double newd=dd(record[i],record[j]);
				d=min(d,newd);
			}
		}
		return d;
		
	}
}
 
int main()
{
	int n,i;
	double d,r;
	while(1)
	{
		scanf("%d",&n);
		if(n==0) break;
		for(i=0;i<n;++i) scanf("%lf %lf",&pt[i].x,&pt[i].y);
	    sort(pt,pt+n,cmp1);  //横坐标升序 
		d=cpair(0,n-1);
		r=d/2.0; 
		printf("%.2lf\n",r);
	}
	return 0;
}