BZOJ：3626: [LNOI2014]LCA（重链剖分+线段树）

题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=3626

解题心得：

• 重链剖分之后刚开始不想写线段树，写了个树状数组，T了十分尴尬。然后老实写线段树。
• 这里的离线处理真的很奇妙，将一个询问分解成两个询问，分别是$[1,l-1]$，$[l,r]$，然后将这$2\ast m$个询问排序，离线处理之后得到的答案再相减才能得到答案。

---

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e6+100;
const ll mod = 201314;

struct Node {
    ll fa, gr_fa, num, size;
}node[maxn];

struct Query {
    ll l, r, z, pos, ans;
}q[maxn];

struct Sum {
    ll sum, lazy;
}sum[maxn];

vector <ll> ve[maxn];

ll n, m, tot, Ans[maxn];

bool cmp(Query x, Query y) {
    return x.r < y.r;
}

void init() {
    for(int i=0;i<=n;i++) {
        ve[i].clear();
    }
    memset(sum, 0, sizeof sum);
    memset(q, 0, sizeof q);
    memset(Ans, 0, sizeof(Ans));
    memset(node, 0, sizeof node);
    tot = 0;
    for(ll i=2;i<=n;i++) {
        ll father; scanf("%lld", &father);
        father = father + 1;
        ve[father].push_back(i);
        ve[i].push_back(father);
    }

    for(ll i=1;i<=2*m;i+=2) {
        ll l, r, z;
        scanf("%lld%lld%lld",&l, &r, &z);
        q[i].l = 1;
        q[i].r = l;
        q[i].z = z+1;
        q[i].pos = i;
        q[i+1].l = 1;
        q[i+1].r = r+1;
        q[i+1].z = z+1;
        q[i+1].pos = i+1;
    }
    sort(q+1, q+1+2*m, cmp);
}

ll get_deep(ll pre, ll now) {
    node[now].size = 1;
    node[now].fa = pre;

    for(ll i=0;i<ve[now].size();i++) {
        ll v = ve[now][i];
        if(v == pre) continue;
        node[now].size += get_deep(now, v);
    }

    return node[now].size;
}

void dfs(ll pre, ll now, ll w) {
    if(w == 0) node[now].gr_fa = now;
    else node[now].gr_fa = node[pre].gr_fa;
    node[now].num = ++tot;

    ll Max = 0, pos = -1;
    for(ll i=0;i<ve[now].size();i++) {
        ll v = ve[now][i];
        if(v == pre) continue;

        if(node[v].size > Max) {
            Max = node[v].size;
            pos = v;
        }
    }

    if(pos == -1) return ;
    dfs(now, pos, 1);
    for(ll i=0;i<ve[now].size();i++) {
        ll v = ve[now][i];
        if(v == pre || v == pos) continue;
        dfs(now, v, 0);
    }
}

void pushdown(int root, int l, int r) {
    if(sum[root].lazy == 0) return ;
    int chl = root<<1, chr = root<<1|1;

    int mid = l + r >> 1;
    sum[chl].sum += (mid-l+1) * sum[root].lazy;
    sum[chr].sum += (r-mid) * sum[root].lazy;
    sum[chl].lazy += sum[root].lazy;
    sum[chr].lazy += sum[root].lazy;
    sum[root].lazy = 0;
}

void update(int root) {
    int chl = root<<1, chr = root<<1|1;
    sum[root].sum = sum[chl].sum + sum[chr].sum;
}

void add(int root ,int l, int r, int ql, int qr, int va) {
    if(l == ql && r == qr) {
        sum[root].sum += va * (r-l+1);
        sum[root].lazy += va;
        return ;
    }

    pushdown(root, l, r);
    int mid = l + r >> 1;
    int chl = root<<1, chr = root<<1|1;
    if(qr <= mid) add(chl, l, mid, ql, qr, va);
    else if(ql > mid) add(chr, mid+1, r, ql, qr, va);
    else {
        add(chl, l, mid, ql, mid, va);
        add(chr, mid+1, r, mid+1, qr, va);
    }
    update(root);
}

ll query(int root, int l,int r, int ql, int qr) {
    if(l == ql && r == qr) {
        return sum[root].sum;
    }

    pushdown(root, l, r);
    int mid = l + r >> 1;
    int chl = root<<1, chr = root<<1|1;
    if(qr <= mid) return query(chl, l, mid, ql, qr);
    else if(ql > mid) return query(chr, mid+1, r, ql, qr);
    else {
        return query(chl, l, mid, ql, mid) + query(chr, mid+1, r, mid+1, qr);
    }
}

void insert(ll x) {
    if(x == 0) return ;
    while(x != -1) {
        ll r = node[x].num;
        ll l = node[node[x].gr_fa].num;
        add(1, 1, tot, l, r, 1);
        x = node[node[x].gr_fa].fa;
    }
}

ll get_ans(ll x) {
    if(x == 0) return 0;
    ll Sum = 0;
    while(x!=-1) {
        ll r = node[x].num;
        ll l = node[node[x].gr_fa].num;
        Sum += query(1, 1, tot, l, r);
        x = node[node[x].gr_fa].fa;
    }
    return Sum;
}

bool cmp2(Query x, Query y) {
    return  x.pos < y.pos;
}

int main() {
//    freopen("1.in.txt", "r", stdin);
    while(scanf("%lld%lld", &n, &m) != EOF) {
        init();
        get_deep(-1, 1);
        dfs(-1, 1, 0);

        ll pre_pos = q[1].l;
        for (ll i = 1; i <= 2 * m; i++) {
            Query now = q[i];
            if (q[i].r <= 0) continue;
            for (ll j = pre_pos; j <= now.r; j++) {
                insert(j);
            }
            pre_pos = max(pre_pos, now.r + 1);
            q[i].ans = get_ans(q[i].z);
        }

        sort(q + 1, q + 1 + 2 * m, cmp2);
        for (int i = 1; i <= 2 * m; i += 2) {
            Ans[i / 2 + 1] = q[i + 1].ans - q[i].ans;
        }
        for (ll i = 1; i <= m; i++) {
            printf("%lld\n", Ans[i] % mod);
        }
    }

    return 0;
}