求和

题目链接

题意：求子树结点权值和
思路：得到树的$dfs$ 序，将子树操作转化为区间操作。树状数组单点更新，区间查询。

#include <bits/stdc++.h>
#define lowbit(x) x & (-x)
using namespace std;
typedef long long ll;

const int maxN = 1000006;
int n, m, k;
ll val[maxN], tree[maxN];

struct EDGE{
    int adj, to;
    EDGE(int a = -1, int b = 0): adj(a), to(b) {}
}edge[maxN << 1];
int head[maxN], cnt;
void add_edge(int u, int v)
{
    edge[cnt] = EDGE(head[u], v);
    head[u] = cnt ++ ;
}

int in[maxN], out[maxN], T;
void dfs(int u, int fa)
{
    in[u] = ++ T;
    for(int i = head[u]; ~i; i = edge[i].adj) {
        int v = edge[i].to;
        if(v == fa) continue;
        dfs(v, u);
    }
    out[u] = T;
}

void add(int i, ll val)
{
    while(i <= n)
    {
        tree[i] += val;
        i += lowbit(i);
    }
}
ll query(int i)
{
    ll res = 0;
    while(i > 0)
    {
        res += tree[i];
        i -= lowbit(i);
    }
    return res;
}

int main()
{
    memset(head, -1, sizeof(head));
    scanf("%d%d%d", &n, &m, &k);
    for(int i = 1; i <= n; ++ i ) {
        scanf("%lld", &val[i]);
    }
    for(int i = 1; i < n; ++ i ) {
        int u, v; scanf("%d%d", &u, &v);
        add_edge(u, v); add_edge(v, u);
    }
    dfs(k, 0);
    for(int i = 1; i <= n; ++ i ) {
        add(in[i], val[i]);
    }
    for(int i = 1; i <= m; ++ i ) {
        int op; scanf("%d", &op);
        if(op == 1) {
            int a; ll x; scanf("%d%lld", &a, &x);
            add(in[a], x);
        } else {
            int a; scanf("%d", &a);
            printf("%lld\n", query(out[a]) - query(in[a] - 1));
        }
    }
    return 0;
}