HDU-1007-Quoit Design（最近点对，分治）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1007

题目大意：给出n个点，输出这n个点中最近距离的两个点的距离/2。

思路：数据范围不允许暴力，那么就开始想有什么更高效的算法，具体的代码推断自行百度。

分治的思路。

算法大致流程：

Step1：现将所有的点分成两部分：

Step2：分开求得最短的部分，只有一个点距离为INF，两个点就是两点间的距离：

Step3：将两两归并，只用比较距离小于minl的点就行了，重复步骤：

结束算法。

ACCode：

// luogu-judger-enable-o2
//#pragma comment(linker, "/STACK:1024000000,1024000000")
 
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<time.h>
 
#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<string>
#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
 
#define ll long long
#define Pair pair<ll,int>
//#define max(a,b) (a)>(b)?(a):(b)
//#define min(a,b) (a)<(b)?(a):(b)
#define clean(a,b) memset(a,b,sizeof(a))// 水印
//std::ios::sync_with_stdio(false);
//  register
const int MAXN=1e5+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const ll mod=192600817;
const double EPS=1.0e-8;
const double PI=acos(-1.0);

struct Point{
	double x,y,t,d;
	Point(double _x=0,double _y=0,double _t=0,double _d=0){
		x=_x;y=_y;t=_t;d=_d;
	}
	friend Point operator + (const Point &a,const Point &b){
		return Point(a.x+b.x,a.y+b.y);
	}
	friend Point operator - (const Point &a,const Point &b){
		return Point(a.x-b.x,a.y-b.y);
	}
	friend double operator ^ (Point a,Point b){//Cro
		return a.x*b.y-a.y*b.x;
	}
	friend int operator == (const Point &a,const Point &b){
		if(fabs(a.x-b.x)<EPS&&fabs(a.y-b.y)<EPS) return 1;
		return 0;
	}
	friend double operator * (const Point &a,const Point &b){
		return a.x*b.x+a.y*b.y;
	}
};
struct V{
	Point start,end;double ang;
	V(Point _start=Point(0,0),Point _end=Point(0,0),double _ang=0.0){
		start=_start;end=_end;ang=_ang;
	}
	friend V operator + (const V &a,const V &b){
		return V(a.start+b.start,a.end+b.end);
	}
	friend V operator - (const V &a,const V &b){
		return V(a.start-b.start,a.end-b.end);
	}
};
Point Dots[MAXN],Dots2[MAXN];

int CmpX(Point a,Point b){
	if(fabs(a.x-b.x)<EPS)
		return a.y<b.y;
	return a.x<b.x;
}
int CmpY(Point a,Point b){
	if(fabs(a.y-b.y)<EPS)
		return a.x<b.x;
	return a.y<b.y;
}
double Distance(Point a,Point b){
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double MinDots2(int n,double d){
	double ans=d;
	sort(Dots2,Dots2+n,CmpY);
	for(int i=0;i<n;++i){
		for(int j=i+1;j<n&&(Dots2[j].y-Dots2[i].y)<d;++j){
			double res=Distance(Dots2[i],Dots2[j]);
			if(res<d){
				ans=res;
			}
		}
	}return ans;
}
double MinDis(Point P[],int n){
	if(n==1) return INF32;
	if(n==2) return Distance(P[0],P[1]);
	int mid=n>>1;
	double ans=min(MinDis(P,mid),MinDis(P+mid,n-mid));
	int k=0;
	for(int i=0;i<n;++i){
		if(fabs(P[i].x-P[mid].x)<ans){
			Dots2[k++]=P[i];
		}
	}ans=min(ans,MinDots2(k,ans));
	return ans;
}
int main(){
	int n;
	while(~scanf("%d",&n)){
		if(n==0) break;
		for(int i=0;i<n;++i){
			scanf("%lf%lf",&Dots[i].x,&Dots[i].y);
		}sort(Dots,Dots+n,CmpX);
		printf("%.2lf\n",MinDis(Dots,n)/2.0);
	}
}


/*
2
0 0
1 1
2
1 1
1 1
3
-1.5 0
0 0
0 1.5
0
*/