问题:
告诉一系列同一平面上的点,求最近点对。
解析:
1暴力算法,遍历每一个点对的距离求出最小值
2分治算法,根据中位点二分左右区间得到最短距离,然后对区间[mid - d, mid + d]求最短距离,两值取小,不断递归。
对于最近对问题最容易最直接想到的就是蛮力算法,我们可以得到每两个点的距离求最小值,但这样的时间复杂度较高。我们可以采用分治的想法解决这一问题,将复杂难问题转化为简单问题解决。但是最短点对可能出现在中位点的左右两侧,所以我们还需要求出中间区间的最短点对。
设计:
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 10;
int n;
struct Node
{
double x, y;
Node() {}
Node(double x, double y) : x(x), y(y) {}
bool operator<(Node tmp)
{
return x < tmp.x;
}
}v[maxn];
double getDis(Node a, Node b)
{
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
double bruteForce()
{
double res = inf * 1.0;
for (int i = 1; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)
{
res = min(res, getDis(v[i], v[j]));
}
}
return res;
}
Node Q[maxn];
double Divide(int l, int r)
{
if (l == r)
return inf * 1.0;
int mid = (l + r) >> 1, tot = 0;
double dis, midx = v[mid].x;
dis = min(Divide(l, mid), Divide(mid + 1, r));
for (int i = l, j = mid + 1; (i <= mid || j <= r); i++)
{
while (j <= r && (v[i].y > v[j].y || i > mid))
Q[tot++] = v[j], j++;
if (fabs(v[i].x - midx) < dis && i <= mid)
{
for (int k = j - 1; k > mid && j - k < 3; k--)
dis = min(dis, getDis(v[i], v[k]));
for (int k = j; k <= r && k - j < 2; k++)
dis = min(dis, getDis(v[i], v[k]));
}
if (i <= mid)
Q[tot++] = v[i];
}
for (int i = l, j = 0; i <= r; i++, j++)
v[i] = Q[j];
return dis;
}
signed main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
double x, y;
cin >> x >> y;
v[i] = Node(x, y);
}
sort(v + 1, v + n + 1);
cout << "Brute force: " << bruteForce() << endl;
cout << "Divide and conquer algorithm: " << Divide(1, n) << endl;
system("pause");
return 0;
}