LightOJ 1348 Aladdin and the Return Journey（树链剖分）

树剖裸题，套kuangbin大佬的模板

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 30010;
struct Edge
{
    int to,next;
} edge[MAXN*2];
int head[MAXN],tot;
int top[MAXN];
int fa[MAXN];
int deep[MAXN];
int num[MAXN];
int p[MAXN];
int fp[MAXN];
int son[MAXN];
int pos,N;
int a[MAXN];//点权

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

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

void dfs1(int u, int pre, int dep)
{
    deep[u] = dep;
    fa[u] = pre;
    num[u] = 1;
    for(int i = head[u]; i != -1; i = edge[i].next)
    {
        int v = edge[i].to;
        if(v == pre) continue;
        dfs1(v,u,dep+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].next)
    {
        int v = edge[i].to;
        if(v != son[u] && v != fa[u])
            getpos(v,v);
    }
}

#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int sum[MAXN<<2];
void build(int l, int r, int rt)
{
    if(l == r)
    {
        sum[rt] = a[fp[l]];
        return;
    }
    int m = (l+r) >> 1;
    build(lson);
    build(rson);
    sum[rt] = sum[rt<<1]+sum[rt<<1|1];
}

void update(int l, int r, int rt, int pos, int val)
{
    if(l == r)
    {
        sum[rt] = val;
        return;
    }
    int m = (l+r) >> 1;
    if(pos <= m) update(lson, pos, val);
    else update(rson, pos, val);
    sum[rt] = sum[rt<<1]+sum[rt<<1|1];
}

int query(int L, int R, int l, int r, int rt)
{
    if(l >= L && r <= R)
        return sum[rt];
    int m = (l+r) >> 1;
    int ret = 0;
    if(L <= m) ret += query(L,R,lson);
    if(R > m) ret += query(L,R,rson);
    return ret;
}

int Calc(int u, int v)
{
    int f1 = top[u];
    int f2 = top[v];
    int tmp = 0;
    while(f1 != f2)
    {
        if(deep[f1] < deep[f2])
        {
            swap(f1,f2);
            swap(u,v);
        }
        tmp += query(p[f1],p[u],1,N,1);
        u = fa[f1];
        f1 = top[u];
    }
    if(deep[u] > deep[v]) swap(u,v);
    tmp += query(p[u],p[v],1,N,1);
    return tmp;
}

int main()
{
    int T,n,u,v,time = 0,q,op,pos,val;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d",&n);
        N = n;
        for(int i = 1; i <= n; ++i)
            scanf("%d",&a[i]);
        for(int i = 0; i < n-1; ++i)
        {
            scanf("%d %d",&u,&v);
            addedge(++u,++v);
            addedge(v,u);
        }
        dfs1(1,0,0);
        getpos(1,1);

        build(1,n,1);
        printf("Case %d:\n",++time);
        scanf("%d",&q);
        while(q--)
        {
            scanf("%d",&op);
            if(op == 0)
            {
                scanf("%d %d",&u,&v);
                printf("%d\n",Calc(u+1,v+1));
            }
            else
            {
                scanf("%d %d",&pos,&val);
                update(1,n,1,p[pos+1],val);
            }
        }
    }
    return 0;
}