【算法分析与设计】分治策略解决最近点对问题

将集合P划分为大小近似相等的两个子集$P_L$和$P_R$
分别计算$P_L$和$P_R$中的最近点对距离$d_L,d_R$
计算$P_L$和$P_R$中各一个点的最近点对$d_{LR}$
最后解为：min{$d_L,d_R,d_{LR}$}

#include<bits/stdc++.h>
using namespace std;
int n;
typedef struct{
    double x,y;
    int idx;
}point;
int cmp(const point&a,const point&b){
    return a.x<b.x;
}
int cmp1(const point&a,const point&b){
    return a.y<b.y;
}
double divide(vector<point>x){
    if(x.size()<=1) return DBL_MAX;
    if(x.size()<=3){
        if(x.size()==2){
            return sqrt((x[0].x-x[1].x)*(x[0].x-x[1].x)+(x[0].y-x[1].y)*(x[0].y-x[1].y));
        }
        else if(x.size()==3){
            double dis1=sqrt((x[0].x-x[1].x)*(x[0].x-x[1].x)+(x[0].y-x[1].y)*(x[0].y-x[1].y));
            double dis2=sqrt((x[2].x-x[1].x)*(x[2].x-x[1].x)+(x[2].y-x[1].y)*(x[2].y-x[1].y));
            return min(dis1,dis2);
        }
    }
    int sz=x.size();
    //按中垂线（x坐标的中位数）划分点
    vector<point>x1(x.begin(),x.begin()+sz/2);
    vector<point>x2(x.begin()+sz/2,x.end());
    int mid=sz/2;
    double sigma=min(divide(x1),divide(x2));
    double midline=x[mid].x;
    vector<point>newp;
    for(int i=0;i<sz;i++){
        if(x[i].x>=midline-sigma&&x[i].x<=midline+sigma);//带宽范围内
        newp.push_back(x[i]);
    }
    sort(newp.begin(),newp.end(),cmp1);
    double dis=sigma;
    for(int i=0;i<newp.size();i++){
        for(int j=1;j<8&&i+j<newp.size();j++){
            double tdis=sqrt((newp[i].x-newp[i+j].x)*(newp[i].x-newp[i+j].x)+(newp[i].y-newp[i+j].y)*(newp[i].y-newp[i+j].y));
            if(tdis<dis)dis=tdis;
        }
    }
    return dis;
}
int main(){
    vector<point>x;
    double tx,ty;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>tx>>ty;
        x.push_back({tx,ty,i});
    }
    sort(x.begin(),x.end(),cmp);
    double mindis=divide(x);
    printf("%.2lf",mindis);
}