bzoj1036: [ZJOI2008]树的统计Count(树剖模版)

树剖入门题,有时间再写lct

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=3e4+10,inf=(1<<30);
int len=0,last[N],
pos[N],bl[N],dep[N],s[N],f[N],size=0,v[N],n,q,
ls[N<<2],rs[N<<2],mx[N<<2],sum[N<<2];
struct Edge{int to,next;Edge(int to=0,int next=0):to(to),next(next){}}e[N<<2];
void add_edge(int u,int v){e[++len]=Edge(v,last[u]);last[u]=len;}
void build(int k,int l,int r)
{
    ls[k]=l;rs[k]=r;
    if(l==r)return;
    int mid=(l+r)>>1;
    build(k<<1,l,mid);
    build(k<<1|1,mid+1,r);
}
void update(int k,int pos,int delta)
{
    if(ls[k]==rs[k]){mx[k]=sum[k]=delta;return ;}
    int mid=(ls[k]+rs[k])>>1;
    if(pos<=mid)update(k<<1,pos,delta);
    else update(k<<1|1,pos,delta);
    sum[k]=sum[k<<1]+sum[k<<1|1];
    mx[k]=max(mx[k<<1],mx[k<<1|1]);
}
int query_sum(int k,int ql,int qr)
{
    if(ql==ls[k]&&qr==rs[k]){return sum[k];}
    int mid=(ls[k]+rs[k])>>1;
    if(qr<=mid)return query_sum(k<<1,ql,qr);
    else if(ql>mid) return query_sum(k<<1|1,ql,qr);
    else return (query_sum(k<<1,ql,mid)+query_sum(k<<1|1,mid+1,qr));
}
int query_mx(int k,int ql,int qr)
{
    if(ql==ls[k]&&qr==rs[k]){return mx[k];}
    int mid=(ls[k]+rs[k])>>1;
    if(qr<=mid)return query_mx(k<<1,ql,qr);
    else if(ql>mid) return query_mx(k<<1|1,ql,qr);
    else return max(query_mx(k<<1,ql,mid),query_mx(k<<1|1,mid+1,qr));   
}
int solvesum(int x,int y)
{
    int sum=0;
    while(bl[x]!=bl[y]) {
        if(dep[bl[x]]<dep[bl[y]])swap(x,y);
        sum+=query_sum(1,pos[bl[x]],pos[x]);
        x=f[bl[x]];
    }if(dep[x]>dep[y])swap(x,y);
    sum+=query_sum(1,pos[x],pos[y]);
    return sum;
}
int solvemx(int x,int y)
{
    int mx=-inf;
    while(bl[x]!=bl[y]) {
        if(dep[bl[x]]<dep[bl[y]])swap(x,y);
        mx=max(mx,query_mx(1,pos[bl[x]],pos[x]));
        x=f[bl[x]];
    }if(dep[x]>dep[y])swap(x,y);    
    mx=max(mx,query_mx(1,pos[x],pos[y]));
    return mx;
}
void dfs1(int u)
{
    s[u]=1;
    for(int i=last[u];i;i=e[i].next) {
        int id=e[i].to;
        if(id==f[u])continue;
        dep[id]=dep[u]+1;f[id]=u;
        dfs1(id);
        s[u]+=s[id];
    }
}
void dfs2(int u,int chain)
{
    pos[u]=++size;bl[u]=chain;int k=0;
    for(int i=last[u];i;i=e[i].next) {
        int id=e[i].to;
        if(dep[id]>dep[u]&&s[id]>s[k]) k=id;
    }if(k==0)return ;dfs2(k,chain);
    for(int i=last[u];i;i=e[i].next) {
        int id=e[i].to;
        if(dep[id]>dep[u]&&id!=k) dfs2(id,id);
    }
}
void solve()
{
    for(int i=1;i<=q;i++) {
        char ch[10];int x,y;
        scanf("%s%d%d",ch,&x,&y);
        if(ch[0]=='C'){update(1,pos[x],y);v[x]=y;}
        else if(ch[1]=='M'){printf("%d\n",solvemx(x,y));}
        else printf("%d\n",solvesum(x,y));
    }
}
int main()
{
    scanf("%d",&n);
    for(int from,to,i=1;i<n;i++) {
        scanf("%d%d",&from,&to);
        add_edge(from,to);add_edge(to,from);
    }fo(i,1,n) scanf("%d",&v[i]);
    dfs1(1);dfs2(1,1);build(1,1,n);
    fo(i,1,n) update(1,pos[i],v[i]);
    scanf("%d",&q);
    solve();
    return 0;
}