（最短点对） Raid (P3417)

题意：　在坐标上有N个点，和另外N个点，求这两个点集合之间的最短点对距离是多少

思路：分治的思想，把点对分成两半，分别比较距离。然后再寻找这两半之间有没有更短的距离。

           时间复杂度为：n*logn*logn

网址： http://poj.org/problem?id=3714

#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

#define N 200010

struct my
{
	double x,y;
	bool f;
}go[N],cur[N];
int n;

bool CmpX(my a,my b) 
{
	return a.x<b.x;
}
bool CmpY(my a,my b)
{
	return a.y<b.y;
}

double dis(my a,my b)
{
	return a.f==b.f?2000000000.0:sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

double Abs(double x)
{
	return x>0.0?x:-x;
}

double Min(double a,double b)
{
	return a>b?b:a;
}

double MinDis(int l,int r)
{
	//cout<<"fuck   "<<l<<' '<<r<<endl;
	if (l+1>=r)
		return dis(go[l],go[r]);
	if (l+2==r)
		return Min(dis(go[l],go[l+1]),Min(dis(go[l],go[r]),dis(go[l+1],go[r])));
	int mid=(l+r)/2;
	double ans=min(MinDis(l,mid),MinDis(mid+1,r));
	int i,j;
	int num=0;
	for (i=l;i<=mid;i++) if (go[mid].x-go[i].x<=ans)
		cur[num++]=go[i];
	for (i=mid+1;i<=r;i++) if (go[i].x-go[i].x<=ans)
		cur[num++]=go[i];

	for (i=0;i<num;i++)
		for (j=i+1;j<i+8 && j<num;j++)
			ans=Min(ans,dis(cur[i],cur[j]));
	return ans;				
}

int main()
{
	int i,t;
	scanf("%d",&t);
	while (t--)
	{
		scanf("%d",&n);
		for (i=0;i<n;i++)
			scanf("%lf%lf",&go[i].x,&go[i].y),go[i].f=true;
		for (n=n+n;i<n;i++)
			scanf("%lf%lf",&go[i].x,&go[i].y),go[i].f=false;
		sort(go,go+n,CmpX);
		printf("%.3lf\n",MinDis(0,n-1));
	}
	
}