HDU 1541 Stars

看起来是二维，其实用一维数组就可以解决了。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <queue>
#include <ctime>
#include <set>
#define ll long long
#define MP make_pair
#define PB push_back
#define SZ(x) ((int)(x).size())
#define REP(i,n) for (int i=0; (i)<(int)n; ++(i))
#define FOR(it,c) for ( __typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it )
using namespace std;

const int N=32010;
const int M=15010;
int num[N],ans[M],n;

inline int low(int x){ return x&(-x); }

int main(){
#ifndef ONLINE_JUDGE
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
#endif
    while(cin>>n){
        memset(num,0,sizeof(num));
        memset(ans,0,sizeof(ans));
        REP(j,n){
            int a,b,sum=0;
            scanf("%d%d",&a,&b);
            for(int i=a+1;i>0;i-=low(i)) sum+=num[i];
            ans[sum]++;
            for(int i=a+1;i<=N;i+=low(i))
                num[i]++;
        }
        REP(i,n) printf("%d\n",ans[i]);
    }
            
}