BZOJ4034 树上操作

树链剖分

对于2操作 以x为根的所有子节点的区间为seg[x],seg[x]+siz[x]-1，该点在线段树的位置到该点位置+以该点为根的子节点个数，因为树链剖分时子节点与根的位置是相连的

数据要用long long存

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
struct node{ int l, r; ll sum, val; } tree[maxn*4];
int ver[maxn*2], Next[maxn*2], head[maxn];
int fa[maxn], son[maxn], top[maxn], siz[maxn], dep[maxn], seg[maxn], rev[maxn];
int tot;
ll sum, num[maxn];
void Add(int x,int y)
{
    ver[++tot] = y; Next[tot] = head[x]; head[x] = tot;
}
inline int read()
{
    int s = 0, sign = 1; char ch = getchar();
    while(ch < '0' || ch > '9'){
        if(ch == '-') sign = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){ s = s*10+ch-'0'; ch = getchar(); }
    return s*sign;
}
void dfs1(int u,int f)
{
    fa[u] = f;
    dep[u] = dep[f]+1;
    siz[u] = 1;
    for(int i = head[u]; i; i = Next[i]){
        int v = ver[i];
        if(v == f) continue;
        dfs1(v,u);
        siz[u] += siz[v];
        if(siz[v] > siz[son[u]]) son[u] = v;
    }
}
void dfs2(int u,int f)
{
    if(son[u]){
        seg[son[u]] = ++seg[0];
        top[son[u]] = top[u];
        rev[seg[0]] = son[u];
        dfs2(son[u],u);
    }
    for(int i = head[u]; i; i = Next[i]){
        int v = ver[i];
        if(top[v]) continue;
        seg[v] = ++seg[0];
        top[v] = v;
        rev[seg[0]] = v;
        dfs2(v,u);
    }
}
void build(int k,int l,int r)
{
    tree[k].l = l; tree[k].r = r; tree[k].val = 0;
    if(l == r){ tree[k].sum = num[rev[l]]; return ; }
    int mid = (l+r)>>1;
    build(k<<1,l,mid);
    build(k<<1|1,mid+1,r);
    tree[k].sum = tree[k<<1].sum+tree[k<<1|1].sum;
}
void change(int k,ll v)
{
    tree[k].val += v;
    tree[k].sum += (tree[k].r-tree[k].l+1)*v;
}
void pushdown(int k)
{
    if(tree[k].val == 0) return ;
    change(k<<1,tree[k].val);
    change(k<<1|1,tree[k].val);
    tree[k].val = 0;
}
void modify(int k,int l,int r,ll v)
{
    if(tree[k].l > r || tree[k].r < l) return ;
    if(tree[k].l >= l && tree[k].r <= r) return change(k,v);
    pushdown(k);
    modify(k<<1,l,r,v);
    modify(k<<1|1,l,r,v);
    tree[k].sum = tree[k<<1].sum+tree[k<<1|1].sum;
}
void query(int k,int l,int r)
{
    if(tree[k].l > r || tree[k].r < l) return ;
    if(tree[k].l >= l && tree[k].r <= r){
        sum += tree[k].sum; return ;
    }
    pushdown(k);
    query(k<<1,l,r);
    query(k<<1|1,l,r);
}
void ask(int x,int y)
{
    int fx = top[x], fy = top[y];
    while(fx != fy){
        if(dep[fx] < dep[fy]) swap(x,y), swap(fx,fy);
        query(1,seg[fx],seg[x]);
        x = fa[fx]; fx = top[x];
    }
    if(dep[x] > dep[y]) swap(x,y);
    query(1,seg[x],seg[y]);
}
int main()
{
    int n = read(), m = read();
    for(int i = 1; i <= n; i++) num[i] = read();
    for(int i = 1,x,y; i < n; i++){
        x = read(); y = read();
        Add(x,y); Add(y,x);
    }
    dfs1(1,0);
    seg[0] = seg[1] = top[1] = rev[1] = 1;
    dfs2(1,0);
    build(1,1,seg[0]);
    for(int i = 1,op,x,y; i <= m; i++){
        op  = read();
        if(op == 3){
            x = read();
            sum = 0;
            ask(1,x);
            printf("%lld\n",sum);
        }
        else{
            x = read(); y = read();
            if(op == 1) modify(1,seg[x],seg[x],(ll)y);
            else modify(1,seg[x],seg[x]+siz[x]-1,(ll)y);
        }
    }
    return 0;
}