Aragorn's Story HDU - 3966

题意：

给一棵树，并给定各个点权的值，然后有3种操作：

I C1 C2 K: 把C1与C2的路径上的所有点权值加上K

D C1 C2 K：把C1与C2的路径上的所有点权值减去K

Q C：查询节点编号为C的权值

区间更新，点查询+点的树链剖分

#pragma comment(linker, "/STACK:1024000000,1024000000)
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=50010;
struct edge
{
    int to,nxt;
}edge[maxn*2];
int head[maxn],tot;
int ee[maxn];
int top[maxn],fa[maxn],deep[maxn],num[maxn],p[maxn],fp[maxn],son[maxn],pos;
void init()
{
    tot=0;
    memset(head,-1,sizeof(head));
    pos=0;
    memset(son,-1,sizeof(son));
}
void add_edge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].nxt=head[u];
    head[u]=tot++;
}
void dfs1(int u,int pre,int d) //???dfs??fa,deep,num,son
{
    deep[u] = d;
    fa[u] = pre;
    num[u] = 1;
    for(int i = head[u];i != -1;i = edge[i].nxt)
    {
        int v = edge[i].to;
        if(v != pre)
        {
            dfs1(v,u,d+1);
            num[u] += num[v];
            if(son[u] == -1 || num[v] > num[son[u]])
                son[u] = v;
        }
    }
}


void getpos(int u,int sp)
{
    top[u]=sp;
    p[u]=++pos;
    fp[p[u]]=u;
    if(son[u] == -1) return;
    getpos(son[u],sp);
    for(int i=head[u];i!=-1;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(v!=son[u]&&v!=fa[u])
            getpos(v,v);
    }
}
struct Node
{
    int l,r;
    int lazy;
    int summ;
}segtree[maxn*4];
void push_down(int i)
{
    if(segtree[i].lazy)
    {
        segtree[i<<1].summ+=segtree[i].lazy*(segtree[i<<1].r-segtree[i<<1].l+1);
        segtree[i<<1|1].summ+=segtree[i].lazy*(segtree[i<<1|1].r-segtree[i<<1|1].l+1);
        segtree[i<<1].lazy+=segtree[i].lazy;
        segtree[i<<1|1].lazy+=segtree[i].lazy;
        segtree[i].lazy=0;
    }
}
void build(int i,int l,int r)
{
    segtree[i].l = l;
    segtree[i].r = r;
    segtree[i].lazy = 0;
    segtree[i].summ=0;
    if(l == r)
    {
        segtree[i].summ = ee[fp[l]];
        return ;
    }
    int mid = (l + r)/2;
    build(i<<1,l,mid);
    build((i<<1)|1,mid+1,r);
}

void add(int i,int l,int r,int val)//???????k???val
{
    if(segtree[i].l == l && segtree[i].r == r)
    {
        segtree[i].summ += val*(segtree[i].r-segtree[i].l+1);
        segtree[i].lazy+=val;
        return;
    }
    push_down(i);
    int mid = (segtree[i].l + segtree[i].r)/2;
    if(r<=mid)
        add(i<<1,l,r,val);
    else if(l>mid)
        add(i<<1|1,l,r,val);
    else
    {
        add(i<<1,l,mid,val);
        add(i<<1|1,mid+1,r,val);
    }
}

int query(int i,int k)
{
    if(segtree[i].l==k&&segtree[i].r==k)
        return segtree[i].summ;
    int mid=(segtree[i].l+segtree[i].r)/2;
    push_down(i);
    if(k <= mid)query(i<<1,k);
    else query((i<<1)|1,k);
}
void findd(int u,int v,int val) //??u->v??????????
{
    int f1 = top[u], f2 = top[v];
    while(f1 != f2)
    {
        if(deep[f1] < deep[f2])
        {
            swap(f1,f2);
            swap(u,v);
        }
        add(1,p[f1],p[u],val);
        u = fa[f1];
        f1 = top[u];
    }
    if(deep[u] > deep[v]) swap(u,v);
    add(1,p[u],p[v],val);
}
int main ()
{
    int n,m,q;
    while(~scanf("%d%d%d",&n,&m,&q))
    {
        init();
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&ee[i]);
        }
        for(int i=1;i<=m;i++)
        {
            int xx,yy;
            scanf("%d %d",&xx,&yy);
            add_edge(xx,yy);
            add_edge(yy,xx);
        }
        dfs1(1,0,0);
        getpos(1,1);
        build(1,1,pos);
        char op;
        int u,v,w;
        while(q--)
        {
            cin>>op;
            if(op=='Q')
            {
                scanf("%d",&u);
                printf("%d\n",query(1,p[u]));
            }
            else if(op=='I')
            {
                scanf("%d%d%d",&u,&v,&w);
                findd(u,v,w);
            }
            else
            {
                scanf("%d%d%d",&u,&v,&w);
                findd(u,v,-w);
            }

        }
    }
    return 0;
}