poj2352

sort一下就是cows。。。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#define lowbit(x) x&(-x)
using namespace std;
int x,y;
int c[151000],MAXN;
inline int sum(int x)
{
    int res=0;
    for(int i=x;i>=1;i-=lowbit(i))res+=c[i];
    return res;
}
inline void add(int x)
{
    for(int i=x;i<=150000;i+=lowbit(i))c[i]++;
}
int ans[151000];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&x,&y);
        x++;
        ans[sum(x)+1]++;
        add(x);
    }
    for(int i=1;i<=n;i++)printf("%d\n",ans[i]);
    return 0;
}