K-th Closest Distance【主席树+二分答案】

HDU-6621 杭电2019多校

---

  区间询问，问的是【l，r】区间内的与P第K接近的数和P的大小差距。

  然后就是去维护一下区间的数量的和，然后我们不断的【p-mid，p+mid】的数的个数，当个数“≥K”的时候，就是我们所要的答案了。然后，我们就去二分答案这个mid就可以了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7, _UP = 1e6;
int N, M, a[maxN], root[maxN*10], tot, lc[maxN*300], rc[maxN*300], val[maxN*300];
void Insert(int &now, int old, int l, int r, int x)
{
    now = ++tot; lc[now] = lc[old]; rc[now] = rc[old]; val[now] = val[old] + 1;
    if(l == r) return;
    int mid = (l + r)>>1;
    if(x <= mid) Insert(lc[now], lc[old], l, mid, x);
    else Insert(rc[now], rc[old], mid + 1, r, x);
}
int query(int p1, int p2, int l, int r, int ql ,int qr)
{
    if(ql <= l && qr >= r) return val[p2] - val[p1];
    int mid = HalF;
    if(qr <= mid) return query(lc[p1], lc[p2], l, mid, ql, qr);
    else if(ql > mid) return query(rc[p1], rc[p2], mid + 1, r, ql, qr);
    else return query(lc[p1], lc[p2], l, mid, ql, qr) + query(rc[p1], rc[p2], mid + 1, r, ql, qr);
}
inline void init()
{
    tot = 0;
    lc[0] = rc[0] = val[0] = 0;
}
int main()
{
    int Cas; scanf("%d", &Cas);
    while(Cas--)
    {
        scanf("%d%d", &N, &M);
        init();
        for(int i=1; i<=N; i++)
        {
            scanf("%d", &a[i]);
            Insert(root[i], root[i-1], 1, _UP, a[i]);
        }
        int l, r, p, K, ans = 0;
        while(M--)
        {
            scanf("%d%d%d%d", &l, &r, &p, &K);
            l = l ^ ans; r = r ^ ans; p = p ^ ans; K = K ^ ans;
            int L = 0, R = _UP, mid = 0;
            while(L <= R)
            {
                mid = (L + R)>>1;
                if(query(root[l-1], root[r], 1, _UP, p - mid, p + mid) >= K)
                {
                    R = mid - 1;
                    ans = mid;
                }
                else
                {
                    L = mid + 1;
                }
            }
            printf("%d\n", ans);
        }
    }
}
/*
1
7 1
1 1 1 2 2 5 5
1 7 2 4
ans:1
 
1
7 1
2 5 9 12 15 91 100
1 7 56 1
ans:35
*/