poj 2352 treap

//15000个坐标，对于每个坐标，其左下方向（含平 垂）坐标的个数就是它的level数
//输出各个level坐标个数
//之前做过线段树。。现在暴个treap
#include <iostream>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <cstdio>

using namespace std;

#define MX 15010

int size, root;
struct Node
{
    int l, r, key, rand_fix;
    int countl, countr;  //左右子树的节点数
}node[MX];

int n, result[MX];
struct Point
{
    int x, y, p;
}point[MX];
bool _cmp(struct Point a, struct Point b)
{
    if(a.x != b.x) return a.x < b.x;
    return a.y < b.y;
}
//left  rotate
void l_rot(int &index)
{
    int y = node[index].r;
    node[index].r = node[y].l;
    node[index].countr = node[y].countl;
    node[y].l = index;
    node[y].countl = node[index].countl + node[index].countr + 1;
    index = y;
}
//right rotate
void r_rot(int &index)
{
    int y = node[index].l;
    node[index].l = node[y].r;
    node[index].countl = node[y].countr;
    node[y].r = index;
    node[y].countr = node[index].countl + node[index].countr + 1;
    index = y;
}
void insert(int &index, int nkey)
{
    if(index == -1)
    {
        index = ++size;
        node[index].l = node[index].r = -1;
        node[index].rand_fix = rand();
        node[index].key = nkey;
        node[index].countl = node[index].countr = 0;

        return ;
    }
    if(nkey < node[index].key)
    {
        node[index].countl++;
        insert(node[index].l, nkey);
        if(node[node[index].l].rand_fix > node[index].rand_fix)
            r_rot(index);
    }
    else
    {
        node[index].countr++;
        insert(node[index].r, nkey);
        if(node[node[index].r].rand_fix > node[index].rand_fix)
            l_rot(index);
    }
}
bool remove(int &index, int nkey)
{
    if(index == -1) return false;
    if(nkey < node[index].key)
        return remove(node[index].l, nkey);
    else if(nkey > node[index].key)
        return remove(node[index].r, nkey);
    if(node[index].l == -1 && node[index].r == -1)
        index = -1;
    else if(node[index].l == -1)
        index = node[index].r;
    else if(node[index].r == -1)
        index = node[index].l;
    else
    {
        if(node[node[index].l].rand_fix < node[node[index].r].rand_fix)
        {
            l_rot(index);
            remove(node[index].l, nkey);
        }
        else
        {
            r_rot(index);
            remove(node[index].r, nkey);
        }
    }
    return true;
}
int find(int index, int nkey)
{
    if(index == -1) return 0;

    if(node[index].key <= nkey)
    {
        return node[index].countl+1 + find(node[index].r, nkey);
    }
    return find(node[index].l, nkey);
}
        
void init()
{
    size = root = -1;
    srand(time(0));
}

void print(int index)
{
    printf("%d ", node[index].key);
    if(node[index].l != -1) printf("left: %d ",node[node[index].l].key);
    if(node[index].r != -1) printf("right:%d ",node[node[index].r].key);
    printf("count: %d  %d\n", node[index].countl, node[index].countr);
    if(node[index].l != -1) print(node[index].l); 
    if(node[index].r != -1) print(node[index].r); 

}
int main()
{
    //freopen("1.txt", "r", stdin);
    init();

    scanf("%d", &n);

    for(int i = 0;i < n;i++)
    {
        scanf("%d %d", &point[i].x, &point[i].y);
        point[i].p = i;
    }
    sort(point,point+n,_cmp);

    for(int i = 0;i < n;i++)
    {
        insert(root, point[i].y);

        result[find(root,point[i].y)-1]++;
    }
    //print(root);
    for(int i = 0;i < n;i++) printf("%d\n", result[i]);
}