poj2352 Stars 树状数组

#include<stdio.h>
#include<string.h>
#define maxn 32005
int level[maxn],c[maxn];
int lowbit(int x)
{
return x&(-x);
}
int sum(int i)
{
int s=0;
while(i)
{
s+=c[i];
i-=lowbit(i);
}
return s;
}
void add(int i)
{
while(i<=maxn)
{
c[i]++;
i+=lowbit(i);
}
}
int main()
{
int n,x,y,i;
while(~scanf("%d",&n))
{
memset(c,0,sizeof(c));
memset(level,0,sizeof(level));
for(i=0;i<n;i++)
{
scanf("%d%d",&x,&y);
x++;
level[sum(x)]++;
add(x);
}
for(i=0;i<n;i++)
printf("%d\n",level[i]);
}
return 0;
}