【USACO2017JAN】 Promotion Counting

【题目链接】

点击打开链接

【算法】

离散化 + dfs + 树状数组

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN 100000
 
int N,i,lth,x,pos;
int a[MAXN+],tmp[MAXN+],rank[MAXN+],ans[MAXN+];
vector<int> E[MAXN+];
 
template <typename T> inline void read(T &x) {
        int f = ; x = ;
        char c = getchar();
        for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }
        for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';
        x *= f;
}
 
template <typename T> inline void write(T x) {
    if (x < ) { putchar('-'); x = -x; }
    if (x > ) write(x/);
    putchar(x%+'');
}
 
template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}
 
struct BinaryIndexedTree {
        int bit[MAXN+];
        int lowbit(int x) { return x & -x; }
        inline void modify(int pos) {
                int i;
                for (i = pos; i <= N; i += lowbit(i)) bit[i]++;
        }
        inline int query(int pos) {
                int i,ret = ;
                for (i = pos; i; i -= lowbit(i)) ret += bit[i];
                return ret;
        }
} BIT;
 
inline void dfs(int x) {
        int i;
        BIT.modify(rank[x]);
        ans[x] = -BIT.query(rank[x]-);
        for (i = ; i < E[x].size(); i++) dfs(E[x][i]);
        ans[x] += BIT.query(rank[x]-);
}
 
int main() {
 
        read(N);
        for (i = ; i <= N; i++) {
                read(a[i]);
                tmp[i] = a[i];
        }
 
        sort(tmp+,tmp+N+);
        for (i = ; i <= N; i++) {
                if (tmp[i] != tmp[i-])
                        tmp[++lth] = tmp[i];
        }
 
        for (i = ; i <= N; i++) {
                pos = lower_bound(tmp+,tmp+lth+,a[i]) - tmp;
                rank[i] = N - pos + ;
        }
 
        for (i = ; i <= N; i++) {
                read(x);
                E[x].push_back(i);
        }
 
        dfs();
 
        for (i = ; i <= N; i++) writeln(ans[i]);
 
         return ;
 
}