bzoj1036: [ZJOI2008]树的统计Count

题面在这里

树链裸题。。直接上代码qwq

/*************************************************************
	Problem: bzoj 1036 [ZJOI2008]树的统计Count
	User: fengyuan
	Language: C++
	Result: Accepted
	Time: 2388 ms
	Memory: 3804 kb
	Submit_Time: 2017-11-18 21:25:03
*************************************************************/

#include<cstdio>
#include<cstring>
#include<algorithm>
#define mid (l+r)/2
#define lc o<<1
#define rc o<<1|1
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
using namespace std;

const int N = 30010;
int n, cnt = 0, clk = 0, m;
int head[N], fa[N], depth[N], sz[N], son[N], w[N], a[N], in[N], top[N];
int sum[N<<2], mx[N<<2];
char s[10];
struct Edge{
	int to, nex;
}e[N<<1];

inline void add(int x, int y)
{
	e[++ cnt].to = y;
	e[cnt].nex = head[x];
	head[x] = cnt;
}

inline void dfs(int u, int last, int s)
{
	depth[u] = s; fa[u] = last; sz[u] = 1;
	for (int i = head[u]; i; i = e[i].nex){
		int v = e[i].to; if (v == last) continue;
		dfs(v, u, s+1); sz[u] += sz[v];
		if (sz[v] > sz[son[u]]) son[u] = v;
	}
}

inline void dfs2(int u, int t)
{
	in[u] = ++ clk; a[clk] = w[u]; top[u] = t;
	if (son[u]) dfs2(son[u], t);
	for (int i = head[u]; i; i = e[i].nex){
		int v = e[i].to; if (v == fa[u] || v == son[u]) continue;
		dfs2(v, v);
	}
}

inline void pushup(int o)
{
	sum[o] = sum[lc]+sum[rc];
	mx[o] = max(mx[lc], mx[rc]);
}

inline void build(int o, int l, int r)
{
	if (l == r){
		sum[o] = a[l]; mx[o] = a[l];
		return;
	}
	build(lc, l, mid); build(rc, mid+1, r);
	pushup(o);
}

inline void update(int o, int l, int r, int x, int y)
{
	if (l == r){
		sum[o] = y; mx[o] = y;
		return;
	}
	if (x <= mid) update(lc, l, mid, x, y);
	else update(rc, mid+1, r, x, y);
	pushup(o);
}

inline int query(int o, int l, int r, int x, int y, bool flag)
{
	if (l == x && r == y) return flag ? mx[o] : sum[o];
	if (y <= mid) return query(lc, l, mid, x, y, flag);
	else if (x > mid) return query(rc, mid+1, r, x, y, flag);
	else{
		int t1 = query(lc, l, mid, x, mid, flag);
		int t2 = query(rc, mid+1, r, mid+1, y, flag);
		if (flag) return max(t1, t2);
		else return t1+t2;
	}
}

inline int getMx(int x, int y)
{
	int ret = -1e9;
	while (top[x] != top[y]){
		if (depth[top[x]] < depth[top[y]]) swap(x, y);
		ret = max(ret, query(1, 1, n, in[top[x]], in[x], 1));
		x = fa[top[x]];
	}
	if (in[x] > in[y]) swap(x, y);
	return max(ret, query(1, 1, n, in[x], in[y], 1));
}

inline int getSum(int x, int y)
{
	int ret = 0;
	while (top[x] != top[y]){
		if (depth[top[x]] < depth[top[y]]) swap(x, y);
		ret += query(1, 1, n, in[top[x]], in[x], 0);
		x = fa[top[x]];
	}
	if (in[x] > in[y]) swap(x, y);
	return ret + query(1, 1, n, in[x], in[y], 0);
}

int main()
{
	scanf("%d", &n);
	rep(i, 1, n-1){
		int x, y; scanf("%d%d", &x, &y);
		add(x, y); add(y, x);
	}
	rep(i, 1, n) scanf("%d", &w[i]);
	dfs(1, 0, 0);
	dfs2(1, 0);
	build(1, 1, n);
	scanf("%d", &m);
	while (m --){
		int x, y;
		scanf("%s%d%d", s, &x, &y);
		if (s[0] == 'C'){
			update(1, 1, n, in[x], y);
		} else {
			if (s[1] == 'M'){
				printf("%d\n", getMx(x, y));
			} else {
				printf("%d\n", getSum(x, y));
			}
		}
	}
	return 0;
}