hdu 1007 Quoit Design(套圈游戏)

Quoit Design

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 56760    Accepted Submission(s): 15057

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

20 01 121 11 13-1.5 00 00 1.50

 

Sample Output

0.710.000.75

 

 代码：

#include<cstdio>#include<algorithm>#include<cmath>#define INF 0x3f3f3f3fusing namespace std;struct node{    double x;    double y;}a[100010];int cmp(node a,node b){    if(a.x==b.x)        return a.y<b.y;    return a.x<b.x;}double del(node a,node b){    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}int main(){    int n;    double min1,min2,s;    while(scanf("%d",&n)&&n)    {        for(int i=0;i<n;i++)            scanf("%lf %lf",&a[i].x,&a[i].y);        sort(a,a+n,cmp);  //防超时        min2=INF;        for(int i=0;i<n-1;i++)        {            min1=INF;            for(int j=i+1;j<n;j++)            {                s=del(a[i],a[j]);                if(s<min1)                    min1=s;                else                    break;  //后面的越来越远，不用计算            }            if(min1<min2)                min2=min1;        }        printf("%.2lf\n",min2/2.0);    }    return 0;}

这个题是要气死我，WA了无数遍，还是事先在网上看懂了别人的再写的，还能WA，我天！！！bug竟然是min1写错位置了，写外面了！！！粗心啊