BZOJ 1036 （树链剖分模板题）

#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cmath>
#include <stack>
#define LL long long
#define mod 1000000007
using namespace std;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
int n,q,sz;
int a[maxn], deep[maxn], size[maxn], fa[maxn];
int pos[maxn], top[maxn];
int sum[maxn*4], max_[maxn*4];
vector<int> vec[maxn];
void dfs1(int x){
    size[x] = 1;
    for(int i=0; i<vec[x].size(); i++){
        int u = vec[x][i];
        if(u == fa[x]) continue;
        deep[u] = deep[x] + 1;
        fa[u] = x;
        dfs1(u);
        size[x] += size[u];
    }
}
void dfs2(int x, int chain){// chain 表示链中的首个标号
    int k = 0;
    sz++;
    pos[x] = sz;//结点x在线段树中的标号
    top[x] = chain;
    for(int i=0; i<vec[x].size(); i++){
        int u = vec[x][i];
        if(deep[u] > deep[x] && size[u] > size[k])
            k = u;
    }
    if(k == 0) return;
    dfs2(k, chain);
    for(int i=0; i<vec[x].size(); i++){
        int u = vec[x][i];
        if(deep[u] > deep[x] && k != u){
            dfs2(u,u);
        }
    }
}
void build(int l, int r, int o){
    if(l == r){
        return;
    }
    int m = (l + r) / 2;
    build(l,m,o*2);
    build(m+1,r,o*2+1);
}
void update(int l, int r, int o, int p, int c){
    if(l == r){
        sum[o] = max_[o] = c;
        return;
    }
    int m = (l + r) / 2;
    if(p <= m) update(l,m,o*2,p,c);
    else update(m+1,r,o*2+1,p,c);
    sum[o] = sum[o*2] + sum[o*2+1];
    max_[o] = max(max_[o*2], max_[o*2+1]);
    return ;
}
int querysum(int l, int r, int o, int ql, int qr){
    if(ql <= l && qr >= r){
        return sum[o];
    }
    int m = (l + r) / 2;
    int ans = 0;
    if(m >= ql)
        ans += querysum(l, m, o*2, ql, qr);
    if(m < qr)
        ans += querysum(m+1, r, o*2+1, ql, qr);
    return ans;
}
int queryone(int l, int r, int o, int ql, int qr){
    if(ql <= l && qr >= r)
        return max_[o];
    int m = (l + r) / 2;
    int ans = -INF;
    if(m >= ql)
        ans = max(ans, queryone(l, m, o*2, ql, qr));
    if(m < qr)
        ans = max(ans, queryone(m+1, r, o*2+1, ql, qr));
    return ans;
}
int solvesum(int x, int y){
    int ans = 0;
    while(top[x] != top[y]){
        if(deep[top[x]] < deep[top[y]]) swap(x,y);
        ans += querysum(1, n, 1, pos[top[x]], pos[x]);
        x = fa[top[x]];
    }
    if(pos[x] > pos[y]) swap(x,y);
    ans += querysum(1, n, 1, pos[x], pos[y]);
    return ans;
}
int solveone(int x, int y){
    int ans = -INF;
    while(top[x] != top[y]){
        if(deep[top[x]] < deep[top[y]]) swap(x,y);
        ans = max(ans, queryone(1, n, 1, pos[top[x]], pos[x]));
        x = fa[top[x]];
    }
    if(pos[x] > pos[y]) swap(x,y);
    ans = max(ans, queryone(1, n, 1, pos[x], pos[y]));
    return ans;
}
int main(){
    scanf("%d",&n);
    for(int i=0; i<n-1; i++){
        int u,v;
        scanf("%d%d",&u,&v);
        vec[u].push_back(v);
        vec[v].push_back(u);
    }
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    dfs1(1);
    dfs2(1,1);
    build(1,n,1);
    for(int i=1; i<=n; i++)
        update(1, n, 1, pos[i], a[i]);
    scanf("%d",&q);
    char s[10];
    while(q--){
        int x,y;
        scanf("%s%d%d",s,&x,&y);
        if(s[0] == 'C'){
            a[x] = y;
            update(1, n, 1, pos[x], y);
        }
        else if(s[1] == 'M')
            printf("%d\n",solveone(x,y));
        else printf("%d\n",solvesum(x,y));
    }
}