P3605 Promotion Counting P(树状数组+dfs

#include <bits/stdc++.h>
//using int_max = 0x3f3f3f3f;
#define long_max 9223372036854775807;
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
using VI = vector<int>;
typedef unsigned long long ull;
const int mod = 1e8 - 3;
int n;
VI g[500050];
PII a[500050];
int q[500050];
int res[500050];
int tree[500050];

int lowbit(int x){
    return x & -x;
}
int query(int pos){
    int s = 0;
    for(int i = pos;i;i -= lowbit(i)){
        s += tree[i];
    }
    return s;
}
void change(int pos,int x){
    for(int i=pos;i<=n;i += lowbit(i)){
        tree[i] += x;
    }
}
void dfs(int now){

    res[now] = -(query(n) - query(q[now]));
    for(int i=0;i<g[now].size();i++){
        dfs(g[now][i]);
    }
    res[now] += (query(n) - query(q[now]));
    change(q[now],1);
    //cout<<now<< " "<<res[now]<<"\n";
}



int main() {
    cin>>n;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        a[i] = {x,i};
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++){
        q[a[i].second] = i;
    }

    for(int i=2;i<=n;i++){
        int x;
        cin>>x;
        g[x].push_back(i);
    }
    dfs(1);
    for(int i=1;i<=n;i++){
        cout<<res[i]<<"\n";
    }

}

考虑在一条dfs 路径上，只关心子节点是否比当前节点的值大

res[x] = -已经大于该节点的数  + 总共比该节点大的数

所以先将前序比该节点的大的数都去掉，然后将后序中的数字插入，