POJ2352 Stars (静态二叉检索树)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int maxx=32010;
const int maxn=15010;
int c[maxx];
int level[maxn];

int sum(int x)
{
    int res=0;
    while(x)
    {
        res+=c[x];
        x-=(x&-x);
    }
    return res;
}
void add(int x,int d)
{
    while(x<=maxx)
    {
        c[x]+=d;
        x+=(x&(-x));
    }
}
int main()
{
    int x,y,n;
    scanf("%d",&n);
    memset(c,0,sizeof(c));
    memset(level,0,sizeof(level));
    for(int i=0;i<n;i++)
    {
        scanf("%d %d",&x,&y);
        level[sum(x+1)]++;
        add(x+1,1);
    }
    for(int i=0;i<n;i++)
        printf("%d\n",level[i]);
    return 0;
}