P3605 [USACO17JAN]Promotion Counting P

                                                        P3605 [USACO17JAN]Promotion Counting P

[USACO17JAN]Promotion Counting P - 洛谷

题意：求树中的任意一个节点为跟的子树中，求比当前子树的根节点权值大的子树节点的个数

思路：其实就是相当于求一个逆序对，看看子节点的元素比父节点元素大的个数，方法就是，从根节点开始dfs，首先我判断一下递归当前这个点的时候有多少个比当前节点大的，然后遍历所有的儿子节点，遍历完之后，再看看当前有多少个点比当前节点大，那么这两个数相减，就是所有子树中比当前节点大的个数，然后再在树状数组中加上当前节点即可

#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<unordered_map>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<set>
#include<cstdlib>
#include<stack>
#include<ctime>
#define forin(i,a,n) for(int i=a;i<=n;i++)
#define forni(i,n,a) for(int i=n;i>=a;i--)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
const double eps=1e-7;
const int N=5e5+7,M=2*N , INF=0x3f3f3f3f,mod=1e9+7;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
void hack() {printf("\n----------------------------------\n");}

template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}

int T;
int n,m,k;
int tr[N];
int h[N],e[M],ne[M],idx;
vector<int> vec;
int timestemp=1;
int ans[N];

struct Node{
	int cost;
};

Node w[N];

void addd(int a,int b) {
	e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}

int get(int x) {
	int l=0,r=vec.size()-1;
	while(l<r) {
		int mid=l+r>>1;
		if(vec[mid]>=x) r=mid;
		else l=mid+1;
	}
	return l+1;
}

int lowbit(int x) {
	return x&-x;
}

void add(int x,int c) {
	for(int i=x;i<=n+1;i+=lowbit(i)) tr[i]+=c;
}

int sum(int x) {
	int res=0;
	for(int i=x;i;i-=lowbit(i)) res+=tr[i];
	return res;
}


void dfs2(int u) {
	int p=sum(n)-sum(w[u].cost);
	for(int i=h[u];i!=-1;i=ne[i]) {
		int j=e[i];
		dfs2(j);
	}
	int k=sum(n)-sum(w[u].cost);
	add(w[u].cost,1);
	ans[u]=k-p;
}

void solve() { 
	n=read();
	
	for(int i=1;i<=n;i++) w[i].cost=read(),vec.push_back(w[i].cost);
	
	sort(vec.begin(),vec.end());
	
	memset(h,-1,sizeof h);
	for(int i=2;i<=n;i++) {
		int c=read();
		addd(c,i);
	}

	for(int i=1;i<=n;i++) {
		int t=get(w[i].cost);
		w[i].cost=t;
	}
	
	dfs2(1);
	
	for(int i=1;i<=n;i++) printf("%d\n",ans[i]);
}

int main() {
    // init();
    // stin();
        
//     scanf("%d",&T);
    T=1; 
    while(T--) solve();
    
    return 0;       
}