[BZOJ3626][LNOI2014]LCA 树链剖分

太神啦！
http://blog.csdn.net/popoqqq/article/details/38823457

/**************************************************************
    Problem: 3626
    User: di4CoveRy
    Language: C++
    Result: Accepted
    Time:3264 ms
    Memory:16944 kb
****************************************************************/

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

#define mid ((l+r)>>1)
#define ls l,mid,t<<1
#define rs mid+1,r,t<<1^1

#define N 100050
#define mod 201314

using namespace std;
typedef long long LL;

struct Monster{ int x,z,r,f; }Q[N];
bool cmp(Monster p1,Monster p2) { return p1.x < p2.x; }
int siz[N],son[N],top[N],fa[N];
int dfn[N],tme;
LL ag[4*N],tr[4*N],trsiz[4*N],ret;
int ll,rr,v; 
int n,q,cnt;
vector<int> e[N];
LL ans[N];

void dfs1(int u) {
    siz[u] = 1;
    for (int i=0;i<(int)e[u].size();i++) {
        int v = e[u][i];
        dfs1(v); siz[u] += siz[v];
        if (!son[u] || siz[v] > siz[ son[u] ]) son[u] = v;
    }
}

void dfs2(int u,int h) {
    top[u] = h; dfn[u] = ++tme; 
    if (son[u]) dfs2(son[u],h);
    for (int i=0;i<(int)e[u].size();i++) {
        int v = e[u][i]; if (v == son[u]) continue;
        dfs2(v,v);
    }
}

LL build(int l,int r,int t) {
    return l == r ? trsiz[t] = 1LL : trsiz[t] = build(ls) + build(rs);
}

void push_down(int t) {
    tr[t<<1] += trsiz[t<<1] * ag[t];
    tr[t<<1^1] += trsiz[t<<1^1] * ag[t];
    ag[t<<1] += ag[t];
    ag[t<<1^1] += ag[t];
    ag[t] = 0;
}

void update(int l,int r,int t) {
    if (l > rr || r < ll) return ;
    if (l >= ll && r <= rr) {
        ag[t] += v;
        tr[t] += 1LL * trsiz[t] * v;
        return ;
    }
    push_down(t); update(ls); update(rs);
    tr[t] = tr[t<<1] + tr[t<<1^1];
}

void query(int l,int r,int t) {
    if (l > rr || r < ll) return ;
    if (l >= ll && r <= rr) { ret += tr[t]; return ; }
    push_down(t); 
    query(ls); query(rs);
    tr[t] = tr[t<<1] + tr[t<<1^1];
}

void add(int x) {
    while (x) {
        int y = top[x];
        ll = dfn[y] , rr = dfn[x] , v = 1;
        update(1,n,1);
        x = fa[y];
    }
}

LL ask(int x) {
    ret = 0;
    while (x) {
        int y = top[x];
        ll = dfn[y] , rr = dfn[x];
        query(1,n,1);
        x = fa[y];
    }
    return ret;
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("1.in","r",stdin);
    #endif
    scanf("%d%d",&n,&q);
    for (int i=2;i<=n;i++) {
        int x; scanf("%d",&x); x++;
        fa[i] = x;
        e[x].push_back(i);
    }
    dfs1(1); dfs2(1,1);
    build(1,n,1);
    for (int i=1;i<=q;i++) {
        int ql,qr,qz;
        scanf("%d%d%d",&ql,&qr,&qz); ql++ , qr++ , qz++;
        Q[++cnt] = (Monster){ql-1,qz,i,-1};
        Q[++cnt] = (Monster){  qr,qz,i, 1};
    }
    sort(Q+1,Q+cnt+1,cmp);
    int T = 0;
    for (int _=1;_<=cnt;_++) {
        while (T<Q[_].x) {
            T++;
            add(T);
        }
        ans[ Q[_].r ] += 1LL * Q[_].f * ask( Q[_].z );
    }
    for (int _=1;_<=q;_++) printf("%d\n",(int)(ans[_] % mod));
    return 0;
}