bzoj 1036: [ZJOI2008]树的统计Count LCT

题意：修改单点值，查询链上sum和链上最大值
 

#include<bits/stdc++.h>
#define en '\n'
#define ll long long
const int maxn = 3e4 +100;
using namespace std;
#define inl inline
const int inf=0x3f3f3f3f;
inl int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,m,top,cnt,a[maxn];
int c[maxn][2],fa[maxn];
int q[maxn];
bool rev[maxn];
int val[maxn],mx[maxn];
ll sum[maxn];
inl bool isroot(int x)
{
    return c[fa[x]][0]!=x&&c[fa[x]][1]!=x;
}
void update(int x)
{
    int l=c[x][0],r=c[x][1];
    sum[x]=(sum[l]+sum[r]+(ll)val[x]);
    mx[x]=val[x];mx[x]=max(mx[x],mx[l]);mx[x]=max(mx[x],mx[r]);
}
void pushdown(int x)
{
    int l=c[x][0],r=c[x][1];
    if(rev[x])
    {
        rev[x]^=1;rev[l]^=1;rev[r]^=1;
        swap(c[x][0],c[x][1]);
    }
}
void rotate(int x)
{
    int y=fa[x],z=fa[y],l,r;
    l=(c[y][1]==x);r=l^1;
    if(!isroot(y))c[z][c[z][1]==y]=x;
    fa[x]=z;fa[y]=x;fa[c[x][r]]=y;
    c[y][l]=c[x][r];c[x][r]=y;
    update(y);update(x);
}
void splay(int x)
{
    q[++top]=x;
    for(int i=x;!isroot(i);i=fa[i])
        q[++top]=fa[i];
    while(top)pushdown(q[top--]);
    while(!isroot(x))
    {
        int y=fa[x],z=fa[y];
        if(!isroot(y))
        {
            if(c[y][0]==x^c[z][0]==y)rotate(x);
            else rotate(y);
        }
        rotate(x);
    }
}
inl void access(int x)
{
    for(int t=0;x;t=x,x=fa[x])
    {
        splay(x);c[x][1]=t;update(x);
    }
}
inl void makeroot(int x)
{
    access(x);splay(x);rev[x]^=1;
}
inl void split(int x,int y)
{
    makeroot(y);access(x);splay(x);
}
inl void link(int x,int y)
{
    makeroot(x);fa[x]=y;
}
inl void cut(int x,int y)
{
    makeroot(x);access(y);splay(y);c[y][0]=fa[x]=0;
}
struct ed{
int x,y;
}edge[maxn];
int main()
{
    #ifdef local
    freopen("input2.txt","r",stdin);
    #endif // local
    n=read();mx[0]=-inf;
    for(int i=1;i<=n-1;i++){
        edge[i].x=read(),edge[i].y=read();
    }
    for(int i=1;i<=n;i++)val[i]=read();
    for(int i=1;i<=n;i++){
        mx[i]=sum[i]=val[i];
    }
    for(int i=1;i<=n-1;i++){
        link(edge[i].x,edge[i].y);
    }
    m=read();
    char s[30];
    while(m--){
        scanf("%s",s);
        int x=read(),y=read();
        if(s[1]=='M'){
            split(x,y);
            cout<<mx[x]<<en;
        }else if(s[1]=='S'){
            split(x,y);
            cout<<sum[x]<<en;
        }else {
            splay(x);
            val[x]=y;
        }
    }
    return 0;
}