#define LENGTH 10000
#define min(X,Y) ((X)<(Y)?(X):(Y))
#include <FLOAT.H>
#include <WINDOWS.H>
#include <TIME.H>
#include <MATH.H>
#include <algorithm>
#include <IOSTREAM>
using namespace std;
struct point{
double x;
double y;
};
point points[LENGTH*2];
// point tempLeft[LENGTH];
// point tempRight[LENGTH];
//排序
int cmpy(point a,point b)
{
return a.y<b.y;
}
int cmpp(point a,point b)
{
if(a.x!=b.x) return a.x<b.x;
return a.y<b.y;
}
//求距离的平方
double Distence(point a,point b)
{
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
//蛮力法函数
double ClosestPoints(int n,point p[],int &index1,int &index2)
{
double minDist=DBL_MAX;
double temp;
for (int i=0;i<n;i++)
for (int j=i+1;j<=n;j++)
{
temp=Distence(p[i],p[j]);
if(temp<minDist)
{
minDist=temp;
index1=i;
index2=j;
}
}
return sqrt(minDist);
}
//分治法函数
double DivPoints(point p[],int begin,int end)
