POJ 2352 Stars 【树状数组】

#include<cstdio>
#include<cstring>
#define FF(x1, x2) for(int i=x1; i<x2; i++)
int Rint() {int x; scanf("%d", &x); return x;}

#define MAXN 15002
#define MAXX 32000

int c[MAXX];		//c数组
int r[MAXN];		//rank

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

int getSum(int x)
{
int sum=0;
while(x>0)
{
sum+=c[x];
x-=lowBit(x);
}
return sum;
}

void insert(int x)
{
while(x<MAXX)
{
c[x]+=1;
x+=lowBit(x);
}
}

int main()
{
int n = Rint();
FF(0, n)
{
int x = Rint();	int y = Rint();
r[getSum(x+1)]++;
insert(x+1);
}
FF(0, n)
{
printf("%d\n", r[i]);
}
}