HDU - 5919 Sequence II 主席树 从后往前

题目链接：https://cn.vjudge.net/problem/HDU-5919

题意：n个数，q次询问，区间[l, r] 每个数记录最靠左的位置，输出中间那个位置

题解：因为记录的是最左的，所以主席树从后往前操作，记录每个数最左的位置。

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
struct node {
	int l, r;
	int val;
}tree[N * 40];
int n, m, q;
int a[N], vis[N];
int root[N], tot;
int ans[N];
void init() {
	for(int i = 0; i < N; i++) {
		vis[i] = 0;
	}
	tot = 0;
}
int update(int pre, int l, int r, int pos, int val) {
	int cur = ++tot;
	tree[cur] = tree[pre];
	tree[cur].val += val;
	if(l == r) return cur;
	int mid = (r + l) >> 1;
	if(pos <= mid) tree[cur].l = update(tree[pre].l, l, mid, pos, val);
	else tree[cur].r = update(tree[pre].r, mid + 1, r, pos, val);
	return cur;
}
int query(int pre, int pl, int pr, int l, int r) {
	if(pl <= l && r <= pr) return tree[pre].val;
	int mid = (l + r) >> 1;
	int res = 0;
	if(pl <= mid) res += query(tree[pre].l, pl, pr, l, mid);
	if(pr >= mid + 1) res += query(tree[pre].r, pl, pr, mid + 1, r);
	return res; 
}
int solve(int pre, int l, int r, int num) {
	if(l == r) return l;
	int mid = (r + l) >> 1;
	if(tree[tree[pre].l].val >= num) return solve(tree[pre].l, l, mid, num);
	else return solve(tree[pre].r, mid + 1, r, num - tree[tree[pre].l].val);
}
int main() {
	int T, ca = 1;
	int l, r, ln, rn, num;
	scanf("%d", &T);
	while(T--) {
		scanf("%d %d", &n, &q);
		init(); 
		for(int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
		}
		root[n + 1] = 0;
		for(int i = n; i >= 1; i--) {
			root[i] = update(root[i + 1], 1, n, i, 1);
			if(vis[a[i]]) {
				root[i] = update(root[i], 1, n, vis[a[i]], -1);
			}
			vis[a[i]] = i;
		}	
		for(int i = 1; i <= q; i++) {
			scanf("%d %d", &l, &r);
			ln = min((l + ans[i - 1]) % n + 1, (r + ans[i - 1]) % n + 1);
			rn = max((l + ans[i - 1]) % n + 1, (r + ans[i - 1]) % n + 1);
			num = query(root[ln], ln, rn, 1, n);
			num = (num + 1) / 2;
	//		cout << num  << endl;
			ans[i] = solve(root[ln], 1, n, num);
	//		printf("%d\n", ans[i]);
		}
		printf("Case #%d: ", ca++);
		for(int i = 1; i <= q; i++ ) printf("%d%c", ans[i], " \n"[i == q]);
	}
	return 0;
}