[题解]LuoGu3567： [POI2014]KUR-Couriers

原题传送门
主席树入门题啦
主席树基础请先去打模板题

此题就是算出询问区间长度，然后记k=(r-l+1)/2
query的过程中，若左儿子的size>k，则递归左儿子
若右儿子的size>k，则递归右儿子
两者不存在否则关系，是并列的，若一波递归后无果，则返回0

Code：

#include <bits/stdc++.h>
#define maxn 500010
using namespace std;
int a[maxn], b[maxn], sum[maxn << 5], lc[maxn << 5], rc[maxn << 5], sz, n, m, p, q, rt[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void build(int &rt, int l, int r){
	rt = ++sz; sum[rt] = 0;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(lc[rt], l, mid); build(rc[rt], mid + 1, r);
}

int update(int o, int l, int r){
	int oo = ++sz; 
	lc[oo] = lc[o], rc[oo] = rc[o], sum[oo] = sum[o] + 1;
	if (l == r) return oo;
	int mid = (l + r) >> 1;
	if (p <= mid) lc[oo] = update(lc[o], l, mid); else rc[oo] = update(rc[o], mid + 1, r);
	return oo;
}

int query(int u, int v, int l, int r, int k){
	int mid = (l + r) >> 1;
	if (l == r) return b[l];
	int ans = 0;
	if (sum[lc[v]] - sum[lc[u]] > k) ans = query(lc[u], lc[v], l, mid, k);
	if (ans) return ans;
	if (sum[rc[v]] - sum[rc[u]] > k) ans = query(rc[u], rc[v], mid + 1, r, k);
	return ans;
}

int main(){
	n = read(), m = read();
	for (int i = 1; i <= n; ++i) a[i] = read(), b[i] = a[i];
	sort(b + 1, b + 1 + n);
	q = unique(b + 1, b + 1 + n) - b - 1;
	build(rt[0], 1, q);
	for (int i = 1; i <= n; ++i){
		p = lower_bound(b + 1, b + 1 + q, a[i]) - b;
		rt[i] = update(rt[i - 1], 1, q);
	}
	while (m--){
		int l = read(), r = read();
		printf("%d\n", query(rt[l - 1], rt[r], 1, q, (r - l + 1) >> 1));
	}
	return 0;
}