牛客第九场 E题 可持续化线段树+dfs序+树上倍增

#include<bits/stdc++.h>
using namespace std;
#define deb cout<<"find::"<<endl
struct AC {
	int ls, rs, num;
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	vector<vector<int>>v(n + 1, vector<int>());
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		v[a].emplace_back(b);
		v[b].emplace_back(a);
	}
	vector<int>tmp(n + 1), s(n + 1);
	tmp[0] = 1e9 + 7;
	for (int i = 1; i <= n; i++) {
		cin >> tmp[i];
		s[i] = tmp[i];
	}
	//deb;
	sort(s.begin() + 1, s.end());
	int len = unique(s.begin() + 1, s.end()) - s.begin() - 1;
	map<int, int>ma;
	for (int i = 1; i <= len; i++)ma[s[i]] = i;

	vector<int>dep(n + 1);
	vector<int>str(n + 1), ste(n + 1);
	vector<int>p;
	vector<vector<int>>f(n + 1, vector<int>(21));
	p.emplace_back(-1);
	int idx = 0;
	function<void(int, int)>prepare = [&](int fa, int now) {
		dep[now] = dep[fa] + 1;
		f[now][0] = fa;
		for (int i = 0; i <=20 ; i++) {
			f[now][i] = f[f[now][i - 1]][i - 1];
		}
		p.emplace_back(now);
		idx++;
		str[now] = idx;
		for (auto it : v[now]) {
			if (it == fa)continue;
			prepare(now, it);
		}
		ste[now] = idx;
	};
	//deb;
	prepare(0, 1);
	//deb;
	vector<int>root(idx + 1);
	int pdx = 0;
	vector<AC>tre(idx << 5);
	function<void(int, int, int, int, int)>build = [&](int fa, int now, int t, int l, int r) {
		if (l == r) {
			tre[now].num = tre[fa].num + 1;
			return;
		}
		int mid = (l + r) >> 1;
		if (t <= mid) {
			tre[now].rs = tre[fa].rs;
			tre[now].ls = ++pdx;
			build(tre[fa].ls, tre[now].ls, t, l, mid);
		}
		else {
			tre[now].ls = tre[fa].ls;
			tre[now].rs = ++pdx;
			build(tre[fa].rs, tre[now].rs, t, mid + 1, r);

		} 
		tre[now].num = tre[tre[now].ls].num + tre[tre[now].rs].num;
	};
	for (int i = 1; i <= idx; i++) {
		root[i] = ++pdx;
		build(root[i - 1], root[i], ma[tmp[p[i]]], 1, len);
	}
	function<int(int, int, int, int, int)>query = [&](int now, int L, int R, int l, int r) {
		int mid = (l + r) >> 1;
		if (l >= L && r <= R)return tre[now].num;
		int a = 0, b = 0;
		if (L <= mid) {
			a = query(tre[now].ls, L, R, l, mid);
		}
		if (R > mid) {
			b = query(tre[now].rs, L, R, mid + 1, r);
		}
		return a + b;
	};
	int m;
	cin >> m;
	
	for (int i = 1; i <= m; i++) {
		int l, r, x;
		cin >> x >> l >> r;
		if (tmp[x] > r || tmp[x] < l) {
			cout << 0 << '\n';
			continue;
		}
		int now = x;
		for (int i = 20; i >= 0; i--) {
			if (tmp[f[now][i]] <= r)now = f[now][i];
		}
		int ll = lower_bound(s.begin() + 1, s.begin() + len, l) - s.begin();
		int rr = lower_bound(s.begin() + 1, s.begin() + len, r) - s.begin();
		if (s[rr] > r)rr--;
		cout << query(root[ste[now]], ll, rr, 1, len) - query(root[str[now] - 1], ll, rr, 1, len) << '\n';
	}
	return 0;
}