HYSBZ 1036 树的统计Count

题意:有一棵树，每个节点有权值。

我们现在有三个操作：

1、改变某点的权值。

2、给出两个点，求这两个点之间的路径上所有点的权值之和。

3、给出两个点，求这两个点之间的路径上所有点的最大权值。

一个裸的树剖，刷了两三天树剖的题了，感觉现在已经把树剖理解的差不多了，具体操作现在已经可以很快在脑海中模拟出来了。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 3e4+10;
int value[maxn],head[maxn];
int N,Q,edge_cnt,tot;
struct Edge{
	int to,next;
}edge[maxn<<1];
void ADD(int u,int v){
	edge[edge_cnt].to = v;
	edge[edge_cnt].next = head[u];
	head[u] = edge_cnt++;
}
int size[maxn],son[maxn],fa[maxn],deep[maxn];
void dfs1(int now,int father,int Deep){
	size[now] = 1;
	fa[now] = father;
	deep[now] = Deep;
	son[now] = 0;
	for(int i = head[now]; ~i; i = edge[i].next){
		int v = edge[i].to;
		if(v != father){
			dfs1(v,now,Deep+1);
			size[now] += size[v];
			if(size[son[now]] < size[v])
				son[now] = v;
		}
	}
}
int ID[maxn],Rank[maxn],top[maxn];
void dfs2(int now,int Top){
	top[now] = Top;
	ID[now] = ++tot;
	Rank[ID[now]] = now;
	if(son[now])
		dfs2(son[now],Top);
	for(int i = head[now]; ~i; i = edge[i].next){
		int v = edge[i].to;
		if(v != fa[now] && v != son[now])
			dfs2(v,v);
	}
}
#define MID int Mid = (l+r)>>1
#define mid int Mid = (tree[now].l+tree[now].r)>>1
struct Info{
	int l,r;
	int val_max,val_sum;
	Info(){};
	Info(int l1,int r1,int val_max1,int val_sum1){
		l = l1,r = r1;
		val_sum = val_sum1,val_max = val_max1;
	}
	void Init(int val){
		val_max = val_sum = val;
	}
	void clear(){
		val_sum = -INF;
	}
};
Info operator + (Info a,Info b){
	if(a.val_sum == -INF)return b;
	if(b.val_sum == -INF)return a;
	Info ret(a.l,b.r,max(a.val_max,b.val_max),a.val_sum+b.val_sum);
	return ret;
}
struct SGT{
	Info tree[maxn<<2];
	void build(int now,int l,int r){
		tree[now].l = l;
		tree[now].r = r;
		if(l == r){
			tree[now].Init(value[Rank[l]]);
			return;
		}
		MID;
		build(now<<1,l,Mid);
		build(now<<1|1,Mid+1,r);
		tree[now] = tree[now<<1]+tree[now<<1|1];
	}
	void update(int now,int idx,int val){
		if(tree[now].l == tree[now].r){
			tree[now].Init(val);
			return;
		}
		mid;
		if(idx <= Mid)
			update(now<<1,idx,val);
		else
			update(now<<1|1,idx,val);
		tree[now] = tree[now<<1]+tree[now<<1|1];
	}
	Info query(int now,int l,int r){
		if(l <= tree[now].l && tree[now].r <= r)
			return tree[now];
		Info ret;
		ret.clear();
		mid;
		if(l <= Mid)
			ret = query(now<<1,l,r) + ret;
		if(Mid < r)
			ret = ret + query(now<<1|1,l,r);
		return ret;
	}
};
SGT sgt;
Info work(int u,int v){
	Info U,V;
	U.clear();
	V.clear();
	int tpu = top[u];
	int tpv = top[v];
	while(tpu != tpv){
		if(deep[tpu] < deep[tpv]){
			swap(u,v);
			swap(tpu,tpv);
			swap(U,V);
		}
		U = U + sgt.query(1,ID[tpu],ID[u]);
		u = fa[tpu];
		tpu = top[u];
	}
	if(deep[u] > deep[v]){
		swap(u,v);
		swap(U,V);
	}
	return U+sgt.query(1,ID[u],ID[v])+V;
}
int main(){
	while(~scanf("%d",&N)){
		memset(head,-1,sizeof(head));
		edge_cnt = tot = 0;
		int u,v;
		for(int i = 1; i < N; i++){
			scanf("%d %d",&u,&v);
			ADD(u,v);
			ADD(v,u);
		}
		for(int i = 1; i <= N; i++)
			scanf("%d",&value[i]);
		dfs1(1,0,0);
		dfs2(1,1);
		sgt.build(1,1,N);
		scanf("%d",&Q);
		char op[10];
		while(Q--){
			scanf("%s %d %d",op,&u,&v);
			if(op[1] == 'H')
				sgt.update(1,ID[u],v);
			else{
				if(op[1] == 'S')
					printf("%d\n",work(u,v).val_sum);
				else
					printf("%d\n",work(u,v).val_max);
			}
		}
	}
	return 0;
}
/*
4
1 2
2 3
4 1
4 2 1 3
12
QMAX 3 4
QMAX 3 3
QMAX 3 2
QMAX 2 3
QSUM 3 4
QSUM 2 1
CHANGE 1 5
QMAX 3 4
CHANGE 3 6
QMAX 3 4
QMAX 2 4
QSUM 3 4
*/