bzoj1036树链剖分模板题

网上树剖的题解多了去了，所以我就贴一下我的code好了。

#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 30005
using namespace std;
struct Tree {int l, r, sum, max;}tree[4*N];
struct Edge {int to, next;}edge[2*N];
int n, cnt = 0, head[N], data[2*N], fa[N], son[N], num[N], dep[N], id[N], pre[N], top[N], Q;
inline void add(int u, int v) {edge[++cnt].to = v; edge[cnt].next = head[u]; head[u] = cnt;}
void dfs1(int k, int fa1, int d) {
	dep[k] = d; fa[k] = fa1; num[k] = 1; son[k] = 0;
	for(int i = head[k]; i; i = edge[i].next) {
		int to = edge[i].to; if(to == fa1) continue;
		dfs1(to, k, d + 1); num[k]+= num[to];
		if(!son[k] || num[to] > num[son[k]]) son[k] = to;
	}
	return ;
}
void dfs2(int k, int tp) {
	top[k] = tp; id[k] = ++cnt; pre[cnt] = k; //id, pre互为反数组 
	if(!son[k]) return ;
	dfs2(son[k], tp);
	for(int i = head[k]; i; i = edge[i].next) {
		int to = edge[i].to;
		if(to != son[k] && to != fa[k]) dfs2(to, to); //轻儿子就不在重链了，于是头也是他自己 
	}
	return ;
}
void build(int k, int l, int r) {
	tree[k].l = l; tree[k].r = r;
	if(l == r) {tree[k].sum = tree[k].max = data[pre[l]]; return ;}
	int mid = (l + r)>>1;
	build(k<<1, l, mid); build((k<<1) + 1, mid + 1, r);
	tree[k].sum = tree[k<<1].sum + tree[(k<<1) + 1].sum;
	tree[k].max = max(tree[k<<1].max, tree[(k<<1) + 1].max);
	return ;
}
void update(int k, int x, int add1) {
	if(tree[k].l == tree[k].r) {
		tree[k].sum+= add1;
		tree[k].max+= add1;
		return ;
	}
	int mid = (tree[k].l + tree[k].r)>>1;
	if(x <= mid) update(k<<1, x, add1); else update((k<<1) + 1, x, add1);
	tree[k].max = max(tree[k<<1].max, tree[(k<<1) + 1].max);
	tree[k].sum = tree[k<<1].sum + tree[(k<<1) + 1].sum;
	return ;
}
int ask_max(int k, int x, int y) {
	if(tree[k].l >= x && tree[k].r <= y) return tree[k].max;
	int mid = (tree[k].l + tree[k].r)>>1, o = -1000000000;
	if(x <= mid) o = ask_max(k<<1, x, y);
	if(y > mid) o = max(o, ask_max((k<<1) + 1, x, y));
	tree[k].sum = tree[k<<1].sum + tree[(k<<1) + 1].sum;
	tree[k].max = max(tree[k<<1].max, tree[(k<<1) + 1].max);
	return o;
}
int ask_sum(int k, int x, int y) {
	if(tree[k].l >= x && tree[k].r <= y) return tree[k].sum;
	int mid = (tree[k].l + tree[k].r)>>1, o = 0;
	if(x <= mid) o+= ask_sum(k<<1, x, y);
	if(y > mid) o+= ask_sum((k<<1) + 1, x, y);
	tree[k].sum = tree[k<<1].sum + tree[(k<<1) + 1].sum;
	tree[k].max = max(tree[k<<1].max, tree[(k<<1) + 1].max);
	return o;
}
inline int find_max(int x, int y) {
	int fx = top[x], fy = top[y], t, ans = -1000000000;
	while(fx != fy) {
		if(dep[fx] < dep[fy]) t = fx, fx = fy, fy = t, t = x, x = y, y = t;
		ans = max(ans, ask_max(1, id[fx], id[x]));
		x = fa[fx]; fx = top[x];
	}
	ans = max(ans, (dep[x] > dep[y])?ask_max(1, id[y], id[x]):ask_max(1, id[x], id[y]));
	return ans;
}
inline int find_sum(int x, int y) {
	int fx = top[x], fy = top[y], t, ans = 0;
	while(fx != fy) {
		if(dep[fx] < dep[fy]) t = fx, fx = fy, fy = t, t = x, x = y, y = t;
		ans+= ask_sum(1, id[fx], id[x]);
		x = fa[fx]; fx = top[x];
	}
	ans+= (dep[x] > dep[y])?ask_sum(1, id[y], id[x]):ask_sum(1, id[x], id[y]);
	return ans;
}
int main() {
	scanf("%d", &n); memset(head, 0, sizeof(head));
	for(int i = 1; i < n; ++i) {
		int x, y;
		scanf("%d%d", &x, &y); add(x, y); add(y, x);
	}
	for(int i = 1; i <= n; ++i) scanf("%d", data+i);
	dfs1(1, 0, 1); cnt = 0; dfs2(1, 1);
	build(1, 1, n);
	scanf("%d", &Q);
	char opt[100];
	while(Q--) {
		int x, y; scanf("%s%d%d", opt, &x, &y);
		if(opt[0] == 'C') update(1, id[x], y - data[x]), data[x] = y;
		else if(opt[1] == 'M') printf("%d\n", find_max(x, y));
		else printf("%d\n", find_sum(x, y));
	}
	return 0;
}