HDU 1007 Quoit Design（计算几何の最近点对）

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.

题目大意：输出最近点对的距离的一半

思路：分治法，先按X轴排序。然后两边分治算最近距离，设为res，然后按y轴合并，只提取出离中间的点的x的距离不超过res的点，采用7点比较法。

代码（1687MS）：

 #include <cstring>
 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 #include <vector>
 using namespace std;
 typedef long long LL;

 struct Point {
     double x, y;
     Point() {}
     Point(double x, double y): x(x), y(y) {}
     void read() {
         scanf("%lf%lf", &x, &y);
     }
     double length() {
         return sqrt(x * x + y * y);
     }
     Point operator - (const Point &rhs) const {
         return Point(x - rhs.x, y - rhs.y);
     }
 };

 double dist(const Point &a, const Point &b) {
     return (a - b).length();
 }

 bool x_cmp(const Point &a, const Point &b) {
     return a.x < b.x;
 }

 bool y_cmp(const Point &a, const Point &b) {
     return a.y < b.y;
 }

 const int MAXN = ;

 Point p[MAXN];
 double ans;
 int n;

 double closest_pair(Point *p, int n) {
     if(n <= ) return 1e100;
     int mid = n / ;
     double x = p[mid].x;
     double res = min(closest_pair(p, mid), closest_pair(p + mid, n - mid));
     inplace_merge(p, p + mid, p + n, y_cmp);
     vector<Point> q;
     for(int i = ; i < n; ++i) {
         if(fabs(p[i].x - x) >= res) continue;
         for(vector<Point>::reverse_iterator it = q.rbegin(); it != q.rend(); ++it) {
             if(p[i].y - it->y >= res) break;
             res = min(res, dist(p[i], *it));
         }
         q.push_back(p[i]);
     }
     return res;
 }

 int main() {
     while(scanf("%d", &n) != EOF && n) {
         for(int i = ; i < n; ++i) p[i].read();
         sort(p, p + n, x_cmp);
         printf("%.2f\n", closest_pair(p, n) / );
     }
 }