POJ2352 Stars 树状数组

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int maxn=15000,maxx=64000+1;
int Tree[maxx],ans[maxn];
inline int lowbit(int x)
{
 return x&(-x);
}
void add(int x,int value)
{
 for(int i=x;i<=maxx;i+=lowbit(i))
 	{
 	 Tree[i]+=value;
	}
}
int get(int x)
{
 int sum=0;
 for(int i=x;i;i-=lowbit(i))
    sum+=Tree[i];
 return sum;
}
int main()
{freopen("t.txt","r",stdin);
 memset(ans,0,sizeof(ans));memset(Tree,0,sizeof(Tree));
 int n;
 scanf("%d",&n);
 int x,y;
 for(int i=0;i<n;i++)
 	{
 	 scanf("%d%d",&x,&y);
 	 x++;
 	 ans[get(x)]++;
 	 add(x,1);
	}
 for(int i=0;i<n;i++)
 	printf("%d\n",ans[i]);
 return 0;
}