【模板】树链剖分

测试：

洛谷：P2590 [ZJOI2008]树的统计

#include<bits/stdc++.h>
#define ls i<<1
#define rs i<<1|1
#define mp_ make_pair
#define Pr pair<int,int>
#define mid (l+r)/2
#define X tree[x]
#define Y tree[y]
using namespace std;
typedef long long ll;

const int NN=200100;
const int inf=0x3f3f3f3f;
string s;char ch;
ll n,m,k,x,y,z,cnt,tmp,num,siz,T,ans,dst;

struct TREE{
    int top,siz,dep,fa,son,id,val;
};

TREE tree[NN];
ll N,Max[NN],sum[NN],rmq[NN];
vector<int> ve[NN];

void dfs1(int u,int f){
    ll maxsiz=0;
    tree[u].fa=f,tree[u].siz=1,tree[u].dep=tree[f].dep+1;
    for(int &v:ve[u]) if(v!=f){
        dfs1(v,u);tree[u].siz+=tree[v].siz;
        if(tree[v].siz>maxsiz) maxsiz=tree[v].siz,tree[u].son=v;
    }
}

void dfs2(int u,int top){
    TREE &U=tree[u];
    U.id=++num,U.top=top,rmq[num]=u;
    if(!U.son) return;
    dfs2(U.son,top);
    for(int &v:ve[u]) if(!tree[v].id) dfs2(v,v);
}

bool update(int l,int r,int pos,int val,int i){
    if(l==r) return Max[i]=val,sum[i]=val;
    if(mid>=pos) update(l,mid,pos,val,ls);
    else update(mid+1,r,pos,val,rs);
    Max[i]=max(Max[ls],Max[rs]);sum[i]=sum[ls]+sum[rs];
}

ll getsum(int l,int r,int L,int R,int i){
    if(L<=l&&r<=R) return sum[i];
    ll summ=0;
    if(mid>=L) summ+=getsum(l,mid,L,R,ls);
    if(mid<R) summ+=getsum(mid+1,r,L,R,rs);
    return summ;
}

ll getmax(int l,int r,int L,int R,int i){
    if(L<=l&&r<=R) return Max[i];
    ll mx=-inf;
    if(mid>=L) mx=max(mx,getmax(l,mid,L,R,ls));
    if(mid<R) mx=max(mx,getmax(mid+1,r,L,R,rs));
    return mx;
}

bool build(int l,int r,int i){
    Max[i]=-inf,sum[i]=0;
    if(l==r) return 1;
    build(l,mid,ls);
    build(mid+1,r,rs);
}

void pre(){
    dfs1(1,0);dfs2(1,1);N=num;
    build(1,N,1);
    for(int i=1;i<=num;i++){
        auto &u=rmq[i];
        update(1,N,i,tree[u].val,1);
    }
}

void query(int x,int y,bool t){
    ll summ=0,Maxx=-inf;
    while(X.top!=Y.top){
        if(tree[X.top].dep<tree[Y.top].dep) swap(x,y);
        summ+=getsum(1,N,tree[X.top].id,X.id,1);
        Maxx=max(Maxx,getmax(1,N,tree[X.top].id,X.id,1));
        x=tree[X.top].fa;
    }
    if(X.dep<Y.dep) swap(x,y);
    summ+=getsum(1,N,Y.id,X.id,1);
    Maxx=max(Maxx,getmax(1,N,Y.id,X.id,1));
    cout<<(t?Maxx:summ)<<endl;
}

int main(){
    ios::sync_with_stdio(false);//cin.tie(0);cout.tie(0);
    //freopen("out.txt","w",stdout);
    cin>>n;
    for(int i=1;i<n;i++){
        cin>>x>>y;
        ve[x].push_back(y);
        ve[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        cin>>tree[i].val;
    }
    pre();cin>>m;
    while(m--){
        cin>>s>>x>>y;
        if(s[0]=='C') update(1,num,tree[x].id,y,1);
        else query(x,y,(s[1]=='M'?1:0));
    }
}