题意:略;
思路:
借用kuangbin大佬一句话:树链剖分就是数据结构在树上的应用
我关于树链剖分的理解:选择树中最长的一条链作为重链(即选择子树较大的孩子结点),依次标号,相当于线段树维护的一个序列中的一个连续区间;
对于一个根结点其他的子结点,新建链,
这样在进行更新操作是单点更新;查询操作时,需要找到两个结点的lca(最近公共祖先),以此为连接点,可以求得两个结点区间内的max 或 sum;
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 3e4 + 7;
const int maxd = 6e4 + 7;
const int INF = 0x7f7f7f7f;
int n, q;
int cnt, sz;
int fa[maxn][15], v[maxn], deep[maxn], size[maxn], head[maxn];
int pos[maxn], belong[maxn];
bool vis[maxn];
struct data {int to,next;}e[maxd];
struct seg{int l, r, mx, sum;}t[maxn<<2];
void add(int u, int v) { // 边表添加边
e[++cnt].to = v; e[cnt].next = head[u]; head[u] = cnt;
e[++cnt].to = u; e[cnt].next = head[v]; head[v] = cnt;
}
void init() {
scanf("%d", &n);
for(int i = 1; i < n; ++i) {
int x, y;
scanf("%d%d", &x, &y);
add(x,y);
}
for(int i = 1; i <= n; ++i) scanf("%d", &v[i]);
}
void dfs1(int x) {
//cout << x << " +++ " << endl;
size[x] = 1; vis[x] = 1;
for(int i = 1; i <= 14; ++i) {
if(deep[x] < (1<<i)) break;
fa[x][i] = fa[fa[x][i-1]][i-1]; // 倍增处理祖先关系
}
for(int i = head[x]; i; i = e[i].next) {
if(vis[e[i].to]) continue;
deep[e[i].to] = deep[x]+1;
fa[e[i].to][0] = x;
dfs1(e[i].to);
size[x] += size[e[i].to];
}
}
void dfs2(int x, int chain) {
int k = 0; sz++;
pos[x] = sz; // 结点x在线段树中编号;
//cout << x << " 线段树中编号 " << sz << endl;
belong[x] = chain;
for(int i = head[x]; i; i = e[i].next) {
if(deep[e[i].to] > deep[x] && size[e[i].to] > size[k]) {
k = e[i].to; // 选择子树最大的儿子
}
}
if(k == 0) return;
dfs2(k, chain);
for(int i = head[x]; i; i = e[i].next) {
if(deep[e[i].to] > deep[x] && e[i].to != k) {
dfs2(e[i].to, e[i].to); // 其余儿子作为链头重新开链
}
}
}
int lca(int x, int y) {
if(deep[x] < deep[y]) swap(x, y);
int t = deep[x] - deep[y];
for(int i = 0; i <= 14; ++i) {
if(t&(1<<i)) x = fa[x][i];
}
for(int i = 14; i >= 0; --i) {
if(fa[x][i] != fa[y][i]) {
x = fa[x][i]; y = fa[y][i];
}
}
if(x == y) return x;
else return fa[x][0];
}
void build(int id, int l, int r) {
t[id].l = l; t[id].r = r;
if(l == r) return;
int mid = (l+r)>>1;
build(id<<1, l, mid);
build(id<<1|1, mid+1, r);
}
void change(int id, int x, int y) { // 单点修改,x 为线段树中的位置
int l = t[id].l, r = t[id].r, mid = (l+r)>>1;
if(l == r) {
t[id].sum = t[id].mx = y; return;
}
if(x <= mid) change(id<<1, x, y);
else change(id<<1|1, x, y);
t[id].sum = t[id<<1].sum + t[id<<1|1].sum;
t[id].mx = max(t[id<<1].mx, t[id<<1|1].mx);
}
int querysum(int id, int x, int y) {
int l = t[id].l, r = t[id].r, mid = (l+r)>>1;
if(l == x && r == y) return t[id].sum;
if(y <= mid) return querysum(id<<1, x, y);
else if(x > mid) return querysum(id<<1|1, x, y);
else return (querysum(id<<1, x, mid)+querysum(id<<1|1, mid+1, y));
}
int solvesum(int x, int f) { // x结点 和 x的祖先结点
int sum = 0;
while(belong[x] != belong[f]) { // 不在一条重链上,走一条轻边
sum += querysum(1, pos[belong[x]], pos[x]);
x = fa[belong[x]][0];
}
sum += querysum(1, pos[f], pos[x]); // 祖先编号一定小于x编号 (线段树中对应编号)
return sum;
}
int querymx(int id, int x, int y) {
int l = t[id].l, r = t[id].r, mid = (l+r)>>1;
if(l == x && r == y) return t[id].mx;
if(y <= mid) return querymx(id<<1, x, y);
else if(x > mid) return querymx(id<<1|1, x, y);
else return (max(querymx(id<<1, x, mid), querymx(id<<1|1, mid+1, y)));
}
int solvemx(int x, int f) {
int mx = -INF;
while(belong[x] != belong[f]) {
mx = max(mx, querymx(1, pos[belong[x]], pos[x]));
x = fa[belong[x]][0];
}
mx = max(mx, querymx(1, pos[f], pos[x]));
return mx;
}
void solve() {
build(1,1,n);
for(int i = 1; i <= n; ++i) {
change(1, pos[i], v[i]);
}
scanf("%d", &q); char ch[7];
for(int i = 0 ; i < q; ++i) {
int x, y; scanf("%s%d%d", ch, &x, &y);
if(ch[0] == 'C') {
v[x] = y; change(1, pos[x], y);
}
else {
int t = lca(x, y);
if(ch[1] == 'M') {
printf("%d\n", max(solvemx(x, t), solvemx(y, t)));
}
else {
printf("%d\n", solvesum(x, t) + solvesum(y, t) - v[t]);
}
}
}
}
int main() {
init();
dfs1(1);
dfs2(1, 1);
solve();
return 0;
}