HDU 1541（Stars）

#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 32005;

int tree[MAXN << 2], num[MAXN << 2];
int x, y;
int level;

void insert(int l, int r, int i)
{
    if (l == r)
        level += tree[i];
    else
    {
        int mid = (l + r) >> 1;
        if (x <= mid)
            insert(l, mid, 2 * i);
        else
        {
            level += tree[2 * i];
            insert(mid + 1, r, 2 * i + 1);
        }
    }
    tree[i]++;
}

int main()
{
    int N;
    while (cin >> N)
    {
        memset(tree, 0, sizeof(tree));
        memset(num, 0, sizeof(num));
        for (int i = 0; i < N; i++)
        {
            cin >> x >> y;
            level = 0;
            insert(0, MAXN, 1);
            num[level]++;
        }
        for (int i = 0; i < N; i++)
            cout << num[i] << endl;
    }
    return 0;
}