BZOJ1036 树链剖分

树链剖分的裸题，非常简单，代码如下。

/**************************************************************
Problem: 1036
User: LeafBigGod
Language: C++
Result: Accepted
Time:4188 ms
Memory:14328 kb
****************************************************************/

#include<cstdio>
#define maxn 200000
#define INF 1000000000
#define Max(a,b) ((a>b)? a:b)
int n,x,y,tot,numm,u,v,w[maxn],q,vet[maxn],next[maxn],head[maxn],fa[maxn],deep[maxn],num[maxn],top[maxn],treeid[maxn],son[maxn],pre[maxn];
char opt[10];
struct tree
{
int l,r,max,sum;
}tree[maxn];
using namespace std;
void add(int u,int v)
{
numm++;
vet[numm]=v;
next[numm]=head[u];
head[u]=numm;
}
void dfs1(int u,int dep,int father)
{
fa[u]=father;
deep[u]=dep;
num[u]=1;
int maxnum=0;
int e,v;
e=head[u];
while (e)
{
    v=vet[e];
    if (v!=father)
    {
        dfs1(v,dep+1,u);
        num[u]+=num[v];
        if (num[v]>maxnum)
        {
            maxnum=num[v];
            son[u]=v;
        }
    }
    e=next[e];
}
}
void dfs2(int u,int number)
{
int e,v;
top[u]=number;
treeid[u]=++tot;
pre[treeid[u]]=u;
if (!son[u]) return;
dfs2(son[u],number);
e=head[u];
while (e)
{
    v=vet[e];
    if (v!=son[u]&&v!=fa[u])
        dfs2(v,v);
    e=next[e];
}
}
void build(int l,int r,int p)
{
tree[p].l=l;tree[p].r=r;
if (l==r)
{
    tree[p].max=tree[p].sum=w[pre[l]];
    return;
}
int mid=(l+r)>>1;
build(l,mid,p<<1);build(mid+1,r,(p<<1)+1);
tree[p].max=Max(tree[p<<1].max,tree[(p<<1)+1].max);
tree[p].sum=tree[p<<1].sum+tree[(p<<1)+1].sum;
}
void change(int p,int x,int val)
{
int l=tree[p].l,r=tree[p].r;
int mid=(l+r)>>1;
if (l==r)
{
    tree[p].max+=val;
    tree[p].sum+=val;
    return;
}
if (x<=mid) change(p<<1,x,val);else change((p<<1)+1,x,val);
tree[p].max=Max(tree[p<<1].max,tree[(p<<1)+1].max);
tree[p].sum=tree[p<<1].sum+tree[(p<<1)+1].sum;
}
int askmax(int p,int x,int y)
{
int l=tree[p].l,r=tree[p].r;
int mid=(l+r)>>1;
int ma=0;
if (l==x&&r==y) return (tree[p].max);
if (y<=mid) ma=askmax(p<<1,x,y);else
if (x>mid) ma=askmax((p<<1)+1,x,y);else
ma=Max(askmax(p<<1,x,mid),askmax((p<<1)+1,mid+1,y));
return ma;
}
int findmax(int u,int v)
{
int f1=top[u],f2=top[v],ans=-INF,t;
while (f1!=f2)
{
    if (deep[f1]<deep[f2])
    {
        t=f1;f1=f2;f2=t;
        t=u;u=v;v=t;
    }
    ans=Max(ans,askmax(1,treeid[f1],treeid[u]));
    u=fa[f1];
    f1=top[u];
}
ans=Max(ans,((deep[u]<deep[v])? askmax(1,treeid[u],treeid[v]):askmax(1,treeid[v],treeid[u])));
return (ans);
}
int asksum(int p,int x,int y)
{
int l=tree[p].l,r=tree[p].r;
int mid=(l+r)>>1;
int su=0;
if (l==x&&r==y) return (tree[p].sum);
if (y<=mid) su=asksum(p<<1,x,y);else
if (x>mid) su=asksum((p<<1)+1,x,y); else
su=(asksum(p<<1,x,mid)+asksum((p<<1)+1,mid+1,y));
return su;
}
int findsum(int u,int v)
{
int f1=top[u],f2=top[v],ans=0,t;
while (f1!=f2)
{
    if (deep[f1]<deep[f2])
    {
        t=f1;f1=f2;f2=t;
        t=u;u=v;v=t;
    }
    ans+=asksum(1,treeid[f1],treeid[u]);
    u=fa[f1];
    f1=top[u];
}
ans+=((deep[u]<deep[v])? asksum(1,treeid[u],treeid[v]):asksum(1,treeid[v],treeid[u]));
return ans;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<n;i++)
{
    scanf("%d%d",&u,&v);
    add(u,v);add(v,u);
}
for (int i=1;i<=n;i++)
    scanf("%d",&w[i]);
dfs1(1,1,0);
tot=0;
dfs2(1,1);
build(1,n,1);
scanf("%d",&q);
while (q--)
{
    scanf("%s%d%d",opt,&u,&v);
    if (opt[0]=='C') change(1,treeid[u],v-w[u]),w[u]=v;else
    if (opt[1]=='M') printf("%d\n",findmax(u,v));else
        printf("%d\n",findsum(u,v));
}
return 0;
}

“`