HDU 1541 Stars 树状数组

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<queue>
#include <deque>
#include <list>
#include <ctime>
#include <stack>
#include <vector>
#include<set>
#define Maxn 15233
#define Maxx 32333
#define MOD
typedef long long ll;
#define FOR(i,j,n) for(int i=j;i<=n;i++)
#define DFR(i,j,k) for(int i=j;i>=k;--i)
#define lowbit(a) a&-a
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
int cnt[Maxn],c[Maxx];
int n,x,y;
int sum(int i)
{   int s=0;
    while(i>0)
    {
        s+=c[i];
        i-=lowbit(i);
    }
    return s;
}
int add(int i,int val)
{   while(i<=Maxx)
    {
    c[i]+=val;
    i+=lowbit(i);
    }

}
int main()
{   while(~scanf("%d",&n))
    {
        memset(c,0,sizeof(c));
        memset(cnt,0,sizeof(cnt));
        FOR(i,1,n)
        {
            scanf("%d%d",&x,&y);
            cnt[sum(++x)]++;
            add(x,1);

        }
        for(int i=0;i<n;i++)
         printf("%d\n",cnt[i]);


    }
    return 0;
}