题意:给你q个询问,l,r, p, k,p与l,r区间内所有数的距离的第k小
思路:主席树维护区间 数的个数,然后 二分答案即可
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int M = 1e6;
struct node {
int l, r;
int val;
}tree[maxn * 55];
int rt[maxn], tot;
int n, q, k, cnt, T, ans, a[maxn];
int update(int pre, int pl, int pr, int val) {
int cur = ++tot;
tree[cur] = tree[pre];
tree[cur].val ++;
if(pl == pr) return cur;
int mid = (pl + pr) >> 1;
if(val <= mid) tree[cur].l = update(tree[pre].l, pl, mid, val);
else tree[cur].r = update(tree[pre].r, mid + 1, pr, val);
return cur;
}
int query(int pl, int pr, int l, int r, int rt, int lt) {
if(pl <= l && r <= pr) {
return tree[rt].val - tree[lt].val;
}
int mid = (l + r) >> 1;
int ans = 0;
if(pl <= mid)
ans += query(pl, pr, l, mid, tree[rt].l, tree[lt].l);
if(pr > mid)
ans += query(pl, pr, mid + 1, r, tree[rt].r, tree[lt].r);
return ans;
}
int main( ) {
int l, r, p;
int pl, pr, mid;
scanf("%d", &T);
while(T--) {
scanf("%d %d", &n, &q);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
rt[i] = update(rt[i - 1], 1, M, a[i]);
}
ans = 0;
while(q--) {
scanf("%d %d %d %d", &l, &r, &p, &k);
l = l ^ ans;
r = r ^ ans;
p = p ^ ans;
k = k ^ ans;
pl = 0, pr = M;
while(pl <= pr) {
mid = (pl + pr) >> 1;
if(query(max(1, p - mid), min(M, p + mid), 1, M, rt[r], rt[l - 1]) >= k) {
ans = mid;
pr = mid - 1;
} else pl = mid + 1;
}
printf("%d\n", ans);
}
}
return 0;
}