平面最近点对模板

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long int ll;
struct P
{
    ll x, y;
    bool operator <(const P& B)const { return x < B.x; }
}p[100050];
ll dis(P &A, P &B) { return (A.x-B.x)*(A.x-B.x) + (A.y-B.y)*(A.y-B.y); }
P Q[100050];
ll Divide(int l, int r)
{
    if(l == r) return (1LL<<62);
    int mid = (l+r)>>1, tot = 0;
    ll d, tx = p[mid].x;
    d = min(Divide(l, mid), Divide(mid+1, r));
    for(int i = l, j = mid+1; (i <= mid || j <= r); i++)
    {
        while(j <= r && (p[i].y > p[j].y || i > mid)) Q[tot++] = p[j], j++; //???y??
        if(abs(p[i].x - tx) < d && i <= mid)  //??????????
        {
            for(int k = j-1; k > mid && j-k < 3; k--) d = min(d, dis(p[i], p[k]));
            for(int k = j; k <= r && k-j < 2; k++) d = min(d, dis(p[i], p[k]));
        }
        if(i <= mid) Q[tot++] = p[i];
    }
    for(int i = l, j = 0; i <= r; i++, j++) p[i] = Q[j];
    return d;
}

int main()
{
    int n;
    ll sum=0;
    cin>>n;
    for(int i = 1; i <= n; i++) cin>>p[i].y,p[i].y+=sum,sum=p[i].y,p[i].x=i-1;
    sort(p+1, p+1+n);
    cout<<Divide(1, n)<<endl;
    return 0;
}