平面最近点距离问题(分治法) C++

#include <stdio.h>
#include <iostream>
#include <climits>
#include <algorithm>
using namespace std;
const int maxn = 100010;
struct point
{
	double x;
	double y;
};
int n;
point P[maxn];
int temp[maxn];

double calDis(int a, int b)
{
	double dis = sqrt((P[a].x - P[b].x) * (P[a].x - P[b].x)*1.0 + 
		(P[a].y - P[b].y) * (P[a].y - P[b].y))*1.0;
	return dis;
}

bool cmpxy(const point& a, const point& b)
{
	if (a.x != b.x)
		return a.x < b.x;
	return a.y < b.y;
}

bool cmpy(int a, int b)
{
	return P[a].y < P[b].y;
}

double minDis(int left, int right)
{
	if (left == right)
	{
		return INT_MAX;
	}
	else if (left + 1 == right)
	{
		return calDis(left, right);
	}
	else {
		int mid = (left+right)>>1;
		double d1 = minDis(left, mid);
		double d2 = minDis(mid + 1, right);
		double d = min(d1, d2);
		int k = 0;
		//先找到距离重点d的点
		for (int i = left; i <= right; i++)
		{
			if (abs(P[i].x - P[mid].x) <= d)
			{
				temp[k++] = i;
			}
		}
		sort(temp, temp + k, cmpy);
		for (int i = 0; i < k; i++)
		{
			for (int j = i + 1; j < k && (P[temp[i]].y-P[temp[j]].y) < d; j++)
			{
				double d3 = calDis(temp[i],temp[j]);
				if (d > d3)
					d = d3;
			}
		}
		return d;
	}
	
}

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> P[i].x >> P[i].y;
	}
	sort(P, P + n, cmpxy);
	double ans = minDis(0, n - 1);
	if (ans > 10000)
	{
		cout << "INFINITY";
	}
	else {
		printf("%.4lf", ans);
	}
}