zoj2112 Dynamic Rankings

题面在这里

题目大意：

给一个序列，要求维护一个数据结构支持单点修改，区间查询第k大。

动态第k大，树状数组套主席树。第一次写树套树。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cctype>
#include<vector>
#include<map>
#include<queue>
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
#define down(i, x, y) for (int i = (x); i >= (y); i --)
#define mid (l+r)/2
#define lc o<<1
#define rc o<<1|1
#define pb push_back
#define mp make_pair
#define Pair pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
typedef long long LL;
//head

const int N = 60005, M = 2500005;
int n, m, Q, tot;
int a[N], b[N], T[N], L[M], R[M], sum[M], use[N], S[N];

struct Questions{
	char s[3];
	int x, y, k;
}q[N];

inline int getHash(int x)
{
	return lower_bound(b+1, b+1+m, x)-b;
}

inline int build(int l, int r)
{
	int rt = ++ tot;
	if (l < r){
		L[rt] = build(l, mid);
		R[rt] = build(mid+1, r);
	}
	return rt;
}

inline int insert(int pre, int l, int r, int x, int v)
{
	int rt = ++ tot;
	L[rt] = L[pre]; R[rt] = R[pre]; sum[rt] = sum[pre] + v;
	if (l < r){
		if (x <= mid){
			L[rt] = insert(L[pre], l, mid, x, v);
		} else {
			R[rt] = insert(R[pre], mid+1, r, x, v);
		}
	}
	return rt;
}

inline int getSum(int k)
{
	int ret = 0;
	for (; k; k -= k&-k) ret += sum[L[use[k]]];
	return ret;
}

inline void update(int k, int p, int v)
{
	for (; k < N; k += k&-k){
		int t = S[k]; S[k] = tot+1;
		insert(t, 1, m, p, v);
	}
}

inline int query(int x, int y, int k)
{
	for (int i = x-1; i; i -= i&-i) use[i] = S[i];
	for (int i = y; i; i -= i&-i) use[i] = S[i];
	int l = 1, r = m, ll = T[x-1], rr = T[y];
	while (l < r){
		int tmp = getSum(y)-getSum(x-1)+sum[L[rr]]-sum[L[ll]];
		if (k <= tmp){
			r = mid;
			for (int i = x-1; i; i -= i&-i) use[i] = L[use[i]];
			for (int i = y; i; i -= i&-i) use[i] = L[use[i]];
			ll = L[ll]; rr = L[rr];
		} else {
			l = mid+1; k -= tmp;
			for (int i = x-1; i; i -= i&-i) use[i] = R[use[i]];
			for (int i = y; i; i -= i&-i) use[i] = R[use[i]];
			ll = R[ll]; rr = R[rr];
		}
	}
	return b[l];
}

int main()
{
	int Test; scanf("%d", &Test);
	while (Test --){
		scanf("%d%d", &n, &Q); m = 0;
		rep(i, 1, n) scanf("%d", &a[i]), b[++ m] = a[i];
		rep(i, 1, Q){
			scanf("%s", q[i].s);
			if (q[i].s[0] == 'Q'){
				scanf("%d%d%d", &q[i].x, &q[i].y, &q[i].k);
			} else {
				scanf("%d%d", &q[i].x, &q[i].y);
				b[++ m] = q[i].y;
			}
		}
		sort(b+1, b+1+m);
		m = unique(b+1, b+1+m)-b-1;
		tot = 0;
		memset(T, 0, sizeof T); memset(sum, 0, sizeof sum);
		memset(L, 0, sizeof L); memset(R, 0, sizeof R);
		memset(use, 0, sizeof use); memset(S, 0, sizeof S);
		T[0] = build(1, m);
		rep(i, 1, n){
			T[i] = insert(T[i-1], 1, m, getHash(a[i]), 1);
		}
		rep(i, 1, n) S[i] = T[0];
		rep(i, 1, Q){
			if (q[i].s[0] == 'Q'){
				printf("%d\n", query(q[i].x, q[i].y, q[i].k));
			} else {
				update(q[i].x, getHash(a[q[i].x]), -1);
				update(q[i].x, getHash(q[i].y), 1);
				a[q[i].x] = q[i].y;
			}
		}
	}
	return 0;
}