让lu哥头痛了许久的代码(洛谷:树的统计)

错在单点修改时传的是a，应该是id[a](Line 89)。谨记！！！

//fushao zuishuai
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll(x) (x<<1)
#define rr(x) (x<<1|1)
using namespace std;

const int N=;
int w[N],a[N],maxx[N*],sum[N*];
int n,m,s[N*][],o[N],top[N],son[N],id[N],cnt,siz[N],d[N],f[N],dfn;

void jia(int a,int b) {s[++cnt][]=b;s[cnt][]=o[a];o[a]=cnt;return;}

void shang(int r) {maxx[r]=max(maxx[ll(r)],maxx[rr(r)]);sum[r]=sum[ll(r)]+sum[rr(r)];}

void js(int r,int z,int y)
{
    if (z==y) {sum[r]=a[z];maxx[r]=a[z];return;}
    int k=z+y>>;js(ll(r),z,k);js(rr(r),k+,y);shang(r);
}

void ddxg(int r,int z,int y,int g,int v)
{
    if (z>g||y<g) return;
    if (z>=g&&y<=g) {sum[r]=v;maxx[r]=v;return;}int k=z+y>>;
    ddxg(ll(r),z,k,g,v);ddxg(rr(r),k+,y,g,v);shang(r);
}

int cx1(int r,int z,int y,int zz,int yy)
{
    if (z>yy||y<zz) return ;if (z>=zz&&y<=yy) return sum[r];
    int k=z+y>>;return cx1(ll(r),z,k,zz,yy)+cx1(rr(r),k+,y,zz,yy);
}

int cx2(int r,int z,int y,int zz,int yy)
{
    if (z>yy||y<zz) return -;if (z>=zz&&y<=yy) return maxx[r];
    int k=z+y>>;return max(cx2(ll(r),z,k,zz,yy),cx2(rr(r),k+,y,zz,yy));
}

void dfs1(int x,int fa,int dep)
{
    f[x]=fa;d[x]=dep;siz[x]=;
    for (int i=o[x];i;i=s[i][])
    if (s[i][]!=fa) {
        dfs1(s[i][],x,dep+);siz[x]+=siz[s[i][]];
        if (siz[s[i][]]>siz[son[x]]) son[x]=s[i][];
    }
}

void dfs2(int x,int tp)
{
    id[x]=++dfn;top[x]=tp;a[dfn]=w[x];
    if (son[x]) dfs2(son[x],tp);
    for (int i=o[x];i;i=s[i][])
    if (s[i][]!=f[x]&&son[x]!=s[i][]) dfs2(s[i][],s[i][]);
}

int qiulu2(int a,int b)
{
    int ans=-3e8;
    while (top[a]!=top[b]) {
        if (d[top[a]]<d[top[b]]) swap(a,b);
        ans=max(ans,cx2(,,n,id[top[a]],id[a]));a=f[top[a]];
    }
    if (d[a]>d[b]) swap(a,b);ans=max(ans,cx2(,,n,id[a],id[b]));
    return ans;
}

int qiulu1(int a,int b)
{
    int ans=;
    while (top[a]!=top[b]) {
        if (d[top[a]]<d[top[b]]) swap(a,b);
        ans+=cx1(,,n,id[top[a]],id[a]);a=f[top[a]];
    }
    if (d[a]>d[b]) swap(a,b);ans+=cx1(,,n,id[a],id[b]);
    return ans;
}

int main()
{
    cin>>n;int a,b,t=n-;while (t--) {scanf("%d%d",&a,&b);jia(a,b);jia(b,a);}
    for (int i=;i<=n;i++) scanf("%d",&w[i]);dfs1(,,);dfs2(,);js(,,n);
    cin>>m;char q[];
    while (m--) {
        scanf("%s",q);
        if (q[]=='H') {scanf("%d%d",&a,&b);ddxg(,,n,id[a],b);}
        if (q[]=='M') {scanf("%d%d",&a,&b);printf("%d\n",qiulu2(a,b));}
        if (q[]=='S') {scanf("%d%d",&a,&b);printf("%d\n",qiulu1(a,b));}
    }
    return ;
}