思路:
先向上跳到那个祖先,然后每个深度开一个vector,然后在给原树一个dfs序,然后直接二分。
c o d e code code
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN = 1e5 + 10;
int n, dep[MAXN];
int f[MAXN][25], cnt = 1;
vector<int> b[MAXN], rt, g[MAXN];
struct node {
int low, dfn;
}a[MAXN];
void dfs(int x, int fa) {
f[x][0] = fa;
a[x].dfn = ++ cnt;
dep[x] = dep[fa] + 1;
g[dep[x]].push_back(cnt);
for(int i = 1; i <= 20; i ++) f[x][i] = f[f[x][i - 1]][i - 1];
for(int i = 0; i < b[x].size(); i ++) {
int y = b[x][i];
if(y == fa) continue;
dfs(y, x);
}
a[x].low = ++ cnt;
}
int rmq(int x, int k) {
int t = 1 << 20, j = 20;
while(k) {
if(k >= t) x = f[x][j], k -= t;
j --, t = 1 << j;
}
return x;
}
int query_(int x, int y) {
return lower_bound(g[y].begin(), g[y].end(), x) - g[y].begin();
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i ++) {
int x;
scanf("%d", &x);
if(x == 0) rt.push_back(i);
else b[x].push_back(i);
}
for(int i = 0; i < rt.size(); i ++)
dfs(rt[i], 0);
int q;
scanf("%d", &q);
while(q --) {
int x, y;
scanf("%d%d", &x, &y);
int l = rmq(x, y);
if(l == 0) {
printf("0\n");
continue;
}
printf("%d\n", query_(a[l].low, dep[x]) - query_(a[l].dfn - 1, dep[x]) - 1);
}
return 0;
}
/*
9
2 0 5 2 0 1 4 3 3
100
1 1
*/