平面最近点对

Description:

Accept:

#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
struct Node {
	LL x, y, id;
}p[100005];
LL a = 0x3f3f3f, b = 0x3f3f3f, mindis = 0x3f3f3f;
LL dis(Node a, Node b) {//这里用距离的平方，好计算，不用开double数组
	return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
bool cmp(Node a, Node b) {
	if (a.x != b.x)return a.x < b.x;
	return a.y < b.y;
}
bool cmpy(Node a, Node b) {
	if (a.y != b.y)return a.y < b.y;
	return a.x < b.x; 
}
void updata(LL a_, LL b_, LL mindis_) {
	if (a_ > b_)
		swap(a_, b_);
	if (mindis == mindis_) {
		if (a > a_ || (a == a_ && b > b_))
			a = a_, b = b_;
	}
	else {
		a = a_, b = b_, mindis = mindis_;
	}
}
void f(LL L, LL R) {
	if (L == R)return;
	else if (R - 1 == L) {
		LL cur = dis(p[L], p[R]);
		if (cur <= mindis) { 
			updata(p[L].id, p[R].id, cur); 
			return;
		}
	}
	LL m = (L + R) / 2;
	f(L, m);
	f(m + 1, R);
	vector<Node>v;
	for (LL i = m; i >= L; i--) {
		if ((p[m].x - p[i].x) * (p[m].x - p[i].x) <= mindis)
			v.push_back(p[i]);
		else
			break;
	}
	for (LL i = m + 1; i <= R; i++) {
		if ((p[m].x - p[i].x) * (p[m].x - p[i].x) <= mindis)
			v.push_back(p[i]);
		else
			break;
	}
	sort(v.begin(), v.end(), [](Node a, Node b) {
			if (a.y != b.y)return a.y < b.y;
			return a.x < b.x;
		});
	for (LL i = 0; i < v.size() - 1; i++) {
		for (LL j = i + 1; j < v.size() && v[j].y <= v[i].y + mindis; j++) {
			LL curdis = dis(v[i], v[j]);
			if (curdis <= mindis)
				updata(v[i].id, v[j].id, curdis);
		}
	}
}
int main() {
	LL N;
	cin >> N;
	for (LL i = 0; i < N; i++) {
		cin >> p[i].x >> p[i].y;
		p[i].id = i;
	}
	sort(p, p + N, [](Node a, Node b) {
			if (a.x != b.x)return a.x < b.x;
			return a.y < b.y;
		});
	f(0, N - 1);
	cout << a << " " << b << endl;
	return 0;
}