hdu 3966 Aragorn's Story (树链剖分)

              树链剖分入门题，敲来作为模板，有想学的可以去树链剖分写的很好，很强大。敲完后才想起来可以用树状数组实现，=.=!!

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define LL long long
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int maxn = 50500;

const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;

int siz[maxn], son[maxn], fa[maxn], dep[maxn];
int top[maxn], w[maxn], val[maxn], tot;
int node[maxn<<2], add[maxn<<2];

vector<int> G[maxn];

void dfs1(int u, int p)
{
    dep[u] = dep[p] +1;
    fa[u] = p;siz[u] = 1;
    int sz = -1;son[u] = 0;
    for(int i = 0; i < G[u].size(); i++)
    {
        int v = G[u][i];
        if(v == p) continue;
        dfs1(v, u);
        if(sz < siz[v]) sz = siz[v], son[u] = v;
        siz[u] += siz[v];
    }
}

void dfs2(int u, int p)
{
    w[u] = tot ++;
    if(son[u])
    {
        top[son[u]] = top[u];
        dfs2(son[u], u);
    }
    for(int i = 0; i < G[u].size(); i ++)
    {
        int v = G[u][i];
        if(v == p || v == son[u]) continue;
        top[v] = v;
        dfs2(v, u);
    }
}

void PushDown(int rt)
{
    add[rt << 1] += add[rt];
    add[rt << 1|1] += add[rt];
    add[rt] = 0;
}


void update(int L, int R, int ad, int l, int r, int rt)
{
    if(L <= l && r <= R)
    {
        add[rt] += ad;
        return ;
    }
    PushDown(rt);
    int m = (l + r) >> 1;
    if(L <= m) update(L, R, ad, lson);
    if(R > m) update(L, R, ad, rson);
}

int query(int p, int l, int r, int rt)
{
    if(l == r) return node[rt] + add[rt];
    PushDown(rt);
    int m = (l + r) >> 1;
    if(p <= m) return query(p, lson);
    return query(p, rson);
}

int n, m, p;

void solve(int u, int v, int ad)
{
    int f1 = top[u], f2 = top[v];
    while(f1 != f2)
    {
        if(dep[f1] < dep[f2]) swap(f1, f2), swap(u, v);
        update(w[f1], w[u], ad, 1, n, 1);
        u = fa[f1]; f1 = top[u];
    }
    if(dep[u] < dep[v]) swap(u, v);
    update(w[v], w[u], ad, 1, n, 1);
}

int main()
{
    while(scanf("%d%d%d", &n, &m, &p) != EOF)
    {
        for(int i = 1; i <= n; i ++)
        {
            scanf("%d", &val[i]);
            G[i].clear();
        }
        for(int i = 0; i < m; i ++)
        {
            int u, v;
            scanf("%d%d", &u, &v);
            G[u].push_back(v);
            G[v].push_back(u);
        }
        dep[0] = 0; tot = 1;top[1] = 1;
        dfs1(1, 0); dfs2(1, 0);
        CLR(node, 0); CLR(add, 0);
        for(int i = 1; i <= n; i ++)
        {
            update(w[i], w[i], val[i], 1, n, 1);
        }
        while(p --)
        {
            int u, v, ad; char op[3];
            scanf("%s", op);
            if(op[0] == 'Q')
            {
                scanf("%d", &u);
                printf("%d\n", query(w[u], 1, n, 1));
            }
            else
            {
                scanf("%d%d%d", &u, &v, &ad);
                if(op[0] == 'D') ad = -ad;
                solve(u, v, ad);
            }
        }
    }
}