树链剖分入门（洛谷 P3178 [HAOI2015]树上操作）

题目链接
发现一个神奇的现象：
数组开到1e5+5结果是mle和tle。绝望之时看了看题解，发现题解开到5e6都没事。我一怒之下开到1e6+5交了一发准备睡觉，结果。。。过了？？wtf？
下面是ac代码：

#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 1e5+5;
const ll lnf = 0x3f3f3f3f3f3f3f3f;
int he[N<<1], ne[N<<1], ver[N];
int dep[N], siz[N], fa[N], son[N], top[N];
int dfn[N];
int su[N], w[N];
int tot = 1;
struct Node
{
    int l, r;
    ll sum, add;
}tr[N<<2];
void add(int x, int y)
{
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
}
void dfs1(int u, int f)
{
    fa[u] = f;
    dep[u] = dep[f]+1;
    siz[u] = 1;
    int mx = -1;
    for (int i = he[u]; i; i = ne[i])
    {
        int y = ver[i];
        if (y == f) continue;
        dfs1(y, u);
        siz[u] += siz[y];
        if (siz[y] > mx)
        {
            mx = siz[y];
            son[u] = y;
        }
    }
}
int cnt;
void dfs2(int u, int t)
{
    dfn[u] = ++cnt;
    top[u] = t;
    w[cnt] = su[u];
    if (!son[u])
        return;
    dfs2(son[u], t);
    for (int i = he[u]; i; i = ne[i])
    {
        int v = ver[i];
        if (v == fa[u] || v == son[u])
            continue;
        dfs2(v, v);
    }
}
inline void pushup(int p)
{
    tr[p].sum = tr[p<<1].sum + tr[p<<1|1].sum;
}
void spread(int p)
{
    if (tr[p].add == 0) return;
    int l = p<<1, r = p<<1|1;
    tr[l].sum += tr[p].add * (tr[l].r - tr[l].l +1);
    tr[r].sum += tr[p].add * (tr[r].r - tr[r].l +1);
    tr[l].add += tr[p].add;
    tr[r].add += tr[p].add;
    tr[p].add = 0;
}
void build(int p, int l, int r)
{
    tr[p].l = l; tr[p].r = r;
    tr[p].add = 0;
    if (l == r)
    {
        tr[p].sum = w[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(p<<1, l, mid);
    build(p<<1|1, mid+1, r);
    pushup(p);
}
void change(int p, int l, int r, ll v)
{
    if (l <= tr[p].l && tr[p].r <= r)
    {
        tr[p].sum += v * (tr[p].r - tr[p].l +1);
        tr[p].add += v;
        return;
    }
    spread(p);
    int mid = (tr[p].l + tr[p].r) >> 1;
    if (l <= mid) change(p<<1, l, r, v);
    if (r > mid) change(p<<1|1, l, r, v);
    pushup(p);
}
ll ask(int p, int l, int r)
{
    if (l <= tr[p].l && tr[p].r <= r)
    {
        return tr[p].sum;
    }
    spread(p);
    ll val = 0;
    int mid = (tr[p].l + tr[p].r) >> 1;
    if (l <= mid) val += ask(p<<1, l, r);
    if (r > mid) val += ask(p<<1|1, l, r);
    return val;
}
void mchange_s(int x, ll v)
{
    change(1, dfn[x], dfn[x] + siz[x] - 1, v);
}
void mchange_a(int x, ll v)
{
    change(1, dfn[x], dfn[x], v);
}
ll mask(int x)
{
    int y = 1;
    ll ans = 0;
    while(top[x] != top[y])
    {
        if (dep[top[x]] < dep[top[y]])
            swap(x, y);
        ans += ask(1, dfn[top[x]], dfn[x]);
        x = fa[top[x]];
    }
    if (dep[x] > dep[y])
        swap(x, y);
    ans += ask(1, dfn[x], dfn[y]);
    return ans;
}
int main()
{
    int n,m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%d", &su[i]);
    for(int i = 1; i < n; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        add(x, y);
        add(y, x);
    }
    dfs1(1, 0);
    dfs2(1, 1);
    build(1, 1, n);
 //   for (int i = 1; i <= n; i++)
  //      cout << dfn[i] << " ";
   // cout << endl;
  // for (int i = 1; i <= 4*n; i++)
  //      cout << tr[i].l << " " << tr[i].r << " " << tr[i].sum << endl;
    while(m--)
    {
        int op;
        scanf("%d", &op);
        int x;
        ll y;
        if (op == 1)
        {
            scanf("%d%lld", &x, &y);
            mchange_a(x, y);
        }
        else if (op == 2)
        {
            scanf("%d%lld", &x, &y);
            mchange_s(x, y);
        }
        else
        {
            scanf("%d", &x);
            printf("%lld\n", mask(x));
        }
    }
    //system("pause");
    return 0;
}