最近对问题（二维平面上的点）分治法

#include<iostream>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;

#define number 1000000

typedef struct point
{
	float x,y;
}point;//定义二维点point，横纵坐标范围均为【-100,100】

void setpoints(point *points,int num)
{      //随机生成兑点数组points中的二维点，
	srand(unsigned(time(NULL)));
	for(int i=0;i<num;i++)
	{
		points[i].x=(rand()%20000)/100.0-100;//调整rand，使得横坐标范围在【-100,100】
		points[i].y=(rand()%20000)/100.0-100;
	}
}

float Distance(point a,point b)
{  //计算平面上任意两点之间的距离
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

bool CmpX(point a,point b)
{   //自定义排序
	return a.x<b.x;
}

float ClosestPair(point points[],int num,point &a,point &b)
{
    float distance;       
    float d1,d2;           
    int i=0,j=0,k=0;      
    point a1,b1,a2,b2;     

    if(num<2)
		return number;   
    
	if(num==2)
    {
        a=points[0];
        b=points[1];
        distance=Distance(points[0],points[1]);
    }
    else
    {
        point *s1=new point[num];     //开辟两个子集
        point *s2=new point[num];  

        sort(points,points+num,CmpX); 
        float mid=points[(num-1)/2].x;  

        for(i=0;i<num/2;i++)
            s1[i]=points[i];
        for(j=0,i=num/2;i<num;i++)
            s2[j++]=points[i];
        d1=ClosestPair(s1,num/2,a1,b1);            
        d2=ClosestPair(s2,num-num/2,a2,b2);  

		if(d1<d2) { distance=d1; a=a1; b=b1;}
        else { distance=d2; a=a2; b=b2;}

        //求解跨分割线并在δ×2δ区间内的最近点对
        point *s=new point[num];   
        for(i=0,k=0;i<num;i++)
            if(abs(points[i].x-mid)<=distance)  s[k++]=points[i];

        for(i=0;i<k;i++)
            for(j=i+1;j<=i+7&&j<k;j++)    
            {
                if(Distance(s[i],s[j])<distance)
                {//如果跨分割线的两点距离小于已知最小距离，则记录该距离
                    distance=Distance(s[i],s[j]);
                    a=s[i];
                    b=s[j];
                }
            }
    }
    return distance;
}


int main()
{
	int N;
	point a,b;
	float d;
	cout<<"请输入二维点个数：";
	cin>>N;

	if(N<2)
		cout<<"请输入大于或等于2的点个数！"<<endl;
	else
	{
		point *points=new point[N];
		setpoints(points,N);
		d=ClosestPair(points,N,a,b);
		cout<<"随机生成的"<<N<<"个二维点如下（按横坐标排序后的点对）："<<endl;
		for(int i=0;i<N;i++)
		{
			cout<<"("<<points[i].x<<","<<points[i].y<<")"<<endl;
		}
		cout<<endl<<"最近点对为："<<"("<<a.x<<","<<a.y<<")和"<<"("<<b.x<<","<<b.y<<")"<<endl<<"最近点对距离为："<<d<<endl; 
	}
	return 0;
}