poj 2352 Stars(树状数组)

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N=32010;
int d
,c
;
int lowbit(int x)
{
return x&(-x);
}
void add(int x)
{
while(x<N)
{
c[x]++;
x+=lowbit(x);
}
}
int sum(int x)
{
int ans=0;
while(x>0)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}
int main()
{
int n;
int x,y;
scanf("%d",&n);
memset(d,0,sizeof(d));
for(int i=1;i<=n;i++)
{scanf("%d%d",&x,&y);//x+1因为树状数组无法处理x=0
x++;
d[sum(x)]++;
add(x);
}
for(int i=0;i<n;i++)
printf("%d\n",d[i]);
return 0;
}