bzoj1941

KD-tree

**了这道题

这个估价函数好鬼畜，把min打成max。。。

关于min的估价函数非常鬼畜，具体我也不知道为什么。

#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + ;
int n, d, root, ans = 2e9, mx, mn;
struct data {
    int x, y, mxx, mnx, mny, mxy, lc, rc;
    bool friend operator < (const data &a, const data &b) {
        if(d == ) return a.x == b.x ? a.y < b.y : a.x < b.x;
        if(d == ) return a.y == b.y ? a.x < b.x : a.y < b.y;
    }
} a[N];
void update(int x)
{
    a[x].mnx = min(a[x].x, min(a[a[x].lc].mnx, a[a[x].rc].mnx));
    a[x].mxx = max(a[x].x, max(a[a[x].lc].mxx, a[a[x].rc].mxx));
    a[x].mny = min(a[x].y, min(a[a[x].lc].mny, a[a[x].rc].mny));
    a[x].mxy = max(a[x].y, max(a[a[x].lc].mxy, a[a[x].rc].mxy));
}
int build(int l, int r, int D)
{
    if(l > r) return ;
    int mid = (l + r) >> ;
    nth_element(a + l, a + mid, a + r + );
    a[mid].mnx = a[mid].mxx = a[mid].x;
    a[mid].mny = a[mid].mxy = a[mid].y;
    a[mid].lc = build(l, mid - , D ^ );
    a[mid].rc = build(mid + , r, D ^ );
    update(mid);
    return mid;
}
int query_mn(int k, int x, int y)
{
    int d = abs(a[k].x - x) + abs(a[k].y - y),
    dl = a[k].lc ? max(a[a[k].lc].mnx - x, ) + max(x - a[a[k].lc].mxx, ) + max(a[a[k].lc].mny - y, ) + max(y - a[a[k].lc].mxy, ) : 5e8,
    dr = a[k].rc ? max(a[a[k].rc].mnx - x, ) + max(x - a[a[k].rc].mxx, ) + max(a[a[k].rc].mny - y, ) + max(y - a[a[k].rc].mxy, ) : 5e8;
    if(d) mn = min(mn, d);
    if(dl < dr)
    {
        if(mn > dl) query_mn(a[k].lc, x, y);
        if(mn > dr) query_mn(a[k].rc, x, y);
    }
    else
    {
        if(mn > dr) query_mn(a[k].rc, x, y);
        if(mn > dl) query_mn(a[k].lc, x, y);
    }
}
int query_mx(int k, int x, int y)
{
    int d = abs(a[k].x - x) + abs(a[k].y - y),
    dl = a[k].lc ? max(abs(a[a[k].lc].mnx - x), abs(a[a[k].lc].mxx - x)) + max(abs(a[a[k].lc].mny - y), abs(a[a[k].lc].mxy - y)) : -5e8,
    dr = a[k].rc ? max(abs(a[a[k].rc].mnx - x), abs(a[a[k].rc].mxx - x)) + max(abs(a[a[k].rc].mny - y), abs(a[a[k].rc].mxy - y)) : -5e8;
    if(d) mx = max(mx, d);
    if(dl > dr)
    {
        if(mx < dl) query_mx(a[k].lc, x, y);
        if(mx < dr) query_mx(a[k].rc, x, y);
    }
    else
    {
        if(mx < dr) query_mx(a[k].rc, x, y);
        if(mx < dl) query_mx(a[k].lc, x, y);
    }
}
int main()
{
    a[].mnx = a[].mny = 5e8;
    a[].mxx = a[].mxy = -5e8;
    scanf("%d", &n);
    for(int i = ; i <= n; ++i) scanf("%d%d", &a[i].x, &a[i].y);
    root = build(, n, );
    for(int i = ; i <= n; ++i)
    {
        mx = -5e8;
        mn = 5e8;
        query_mn(root, a[i].x, a[i].y);
        query_mx(root, a[i].x, a[i].y);
        ans = min(ans, mx - mn);
    }
    printf("%d\n", ans);
    return ;
}