HDU - 1007 平面最近点对

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. 

InputThe 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. 
OutputFor 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

2
0 0
1 1
2
1 1
1 1
3
-1.5 0
0 0
0 1.5
0

Sample Output

0.71
0.00
0.75

思路：每次按x坐标分成左右两坨，处理完左右两坨后考虑中间相邻的那部分，考虑可能更新答案的点集，按y值双指针移动即可，一个trick是合并两个子问题时同时类似归并排序将点按y值顺便排好序而不是每次快排重新排序。
每次合并代价O（n），这样最终复杂度nlogn。

#include <iostream>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iomanip>
#include <cctype>
#include <cassert>
#include <bitset>
#include <ctime>

using namespace std;

#define pau system("pause")
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define clr(a, x) memset(a, x, sizeof(a))

const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;

/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
tree<pli, null_type, greater<pli>, rb_tree_tag, tree_order_statistics_node_update> T;
*/

struct point {
    double x, y;
    void input() {
        scanf("%lf%lf", &x, &y);
    }
    double dis(const point &p) {
        return sqrt((x - p.x) * (x - p.x) + (y - p.y) * (y - p.y));
    }
    bool operator < (const point &p) const {
        return x < p.x;}
} p[100015], q[100015], p1[100015], p2[100015];
int n;
double dis;
void mymerge(int s, int e) {
    if (s == e) return;
    int mi = s + e >> 1;
    mymerge(s, mi);
    mymerge(mi + 1, e);
    double d2 = p[mi].x + dis;
    double d1 = p[mi + 1].x - dis;
    int i = s, j = mi + 1, k = s, i1 = 1, i2 = 1;
    while (i <= mi && j <= e) {
        if (p[i].y < p[j].y) {
            if (d1 - EPS <= p[i].x && p[i].x <= d2 + EPS) {
                p1[i1++] = p[i];
            }
            q[k++] = p[i++];
        }
        else {
            if (d1 - EPS <= p[j].x && p[j].x <= d2 + EPS) {
                p2[i2++] = p[j];
            }
            q[k++] = p[j++];
        }
    }
    while (i <= mi) {
        if (d1 - EPS <= p[i].x && p[i].x <= d2 + EPS) {
            p1[i1++] = p[i];
        }
        q[k++] = p[i++];
    }
    while (j <= e) {
        if (d1 - EPS <= p[j].x && p[j].x <= d2 + EPS) {
            p2[i2++] = p[j];
        }
        q[k++] = p[j++];
    }
    for (int i = s; i <= e; ++i) p[i] = q[i];
    for (int i = 1, j = 1; i < i1 && j < i2; ++i) {
        while (j < i2 && p2[j].y < p1[i].y - dis) ++j;
        for (int k = j; k < i2 && p2[j].y < p1[i].y + dis; ++k) {
            double td = p1[i].dis(p2[j]);
            dis = min(dis, td);
        }
    }
}
int main() {
    while (~scanf("%d", &n) && n) {
        for (int i = 1; i <= n; ++i) {
            p[i].input();
        }
        sort(p + 1, p + n + 1);
        dis = 1e18;
        mymerge(1, n);
        printf("%.2f\n", dis / 2);
    }
    return 0;
}