bzoj4756 [Usaco2017 Jan]Promotion Counting（dfs+BIT）

dfs+树状数组即可。子树内的贡献就是进子树前存一个，出子树存一个，差就是子树内的贡献。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,a[N],aa[N],m,c[N],ans[N];
vector<int>son[N];
inline void add(int x,int val){
    for(;x<=m;x+=x&-x) c[x]+=val;
}
inline int ask(int x){
    int res=0;for(;x;x-=x&-x) res+=c[x];return res;
}
void dfs(int x){
    ans[x]-=ask(m-a[x]);
    for(int i=0;i<son[x].size();++i){
        int y=son[x][i];dfs(y);
    }ans[x]+=ask(m-a[x]);add(m-a[x]+1,1);
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=1;i<=n;++i) a[i]=aa[i]=read();
    sort(aa+1,aa+n+1);m=unique(aa+1,aa+n+1)-aa-1;
    for(int i=2;i<=n;++i) son[read()].push_back(i);
    for(int i=1;i<=n;++i) a[i]=lower_bound(aa+1,aa+m+1,a[i])-aa;
    dfs(1);for(int i=1;i<=n;++i) printf("%d\n",ans[i]);
    return 0;
}