HDOJ3966 树链剖分

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn = 5e4+10;
struct Edge
{
    int to,nxt;
}e[maxn<<1];

int head[maxn],tot;
int top[maxn],fa[maxn],dep[maxn];
int num[maxn],p[maxn],fp[maxn],son[maxn];
int pos,n;
int bit[maxn],a[maxn];

void init()
{
    tot=0;
    memset(head,-1,sizeof(head));
    pos = 1;
    memset(son,-1,sizeof(son));
}

void addedge(int u,int v)
{
    e[tot].to = v;
    e[tot].nxt = head[u];
    head[u] = tot++;
}

void dfs1(int u,int pre,int d)
{
    dep[u] = d;
    fa[u] = pre;
    num[u] = 1;
    for(int i = head[u];~i;i = e[i].nxt)
    {
        int v = e[i].to;
        if(v != pre)
        {
            dfs1(v,u,d+1);
            num[u] += num[v];
            if(num[son[u]]<num[v] || son[u]==-1)
                son[u] = v;
        }
    }
}

void dfs2(int u,int sp)
{
    top[u] = sp;
    p[u] = pos++;
    fp[p[u]] = u;
    if(son[u]==-1) return ;
    dfs2(son[u],sp);
    for(int i=head[u];~i;i=e[i].nxt)
    {
        int v = e[i].to;
        if(v!=fa[u] && v!=son[u])
            dfs2(v,v);
    }
}

int lowbit(int x)
{
    return x&(-x);
}

void add(int k,int val)
{
    while( k<=n )
    {
        bit[k] += val;
        k += lowbit(k);
    }
}

int sum(int k)
{
    int s = 0;
    while(k)
    {
        s+=bit[k];
        k-=lowbit(k);
    }
    return s;
}

void update(int u,int v,int val)
{
    int f1 = top[u],f2 = top[v];
    int tmp = 0;
    while(f1 != f2)
    {
        if(dep[f1]<dep[f2])
        {
            swap(f1,f2);
            swap(u,v);
        }
        add(p[f1],val);
        add(p[u]+1,-val);
        u = fa[f1];
        f1 = top[u];
    }
    if(dep[u]>dep[v])swap(u,v);
    add(p[u],val);
    add(p[v]+1,-val);
}

int main()
{
    int m,P,u,v,c1,c2,k;
    char op[10];
    while(~scanf("%d%d%d",&n,&m,&P))
    {
        init();
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        while(m--)
        {
            scanf("%d%d",&u,&v);
            addedge(u,v);
            addedge(v,u);
        }
        dfs1(1,0,0);
        dfs2(1,1);
        memset(bit,0,sizeof(bit));
        for(int i=1;i<=n;i++)
        {
            add(p[i],a[i]);
            add(p[i]+1,-a[i]);
        }
        while(P--)
        {
            scanf("%s",op);
            if(op[0]=='Q')
            {
                scanf("%d",&u);
                printf("%d\n",sum(p[u]));
            }
            else
            {
                scanf("%d%d%d",&c1,&c2,&k);
                if(op[0]=='D')k=-k;
                update(c1,c2,k);
            }
        }
    }
    return 0;
}