jasison君我来无耻地抄(xue)写(xi)代码了~
#include <cstdio>
#include <cstring>
struct Node
{
int a, b, cover;
Node() {}
Node(int _a, int _b): a(_a), b(_b), cover(0) {}
int middle() { return (a+b)>>1; }
} t[66000];
void build(int a, int b, int d)
{
t[d] = Node(a,b);
if (a >= b) return ;
int mid = (a+b) >> 1;
build(a,mid,2*d+1);
build(mid+1,b,2*d+2);
}
void add(int n, int d)
{
t[d].cover ++;
if (t[d].a == t[d].b) return ;
int mid = t[d].middle();
if (mid >= n) add(n, 2*d+1);
else add(n,2*d+2);
}
int quary(int a, int b, int d)
{
if (a==t[d].a && b==t[d].b) return t[d].cover;
int mid = t[d].middle();
if (mid >= b) return quary(a,b,2*d+1);
else if (mid < a) return quary(a,b,2*d+2);
else return quary(a,mid,2*d+1) + quary(mid+1,b,2*d+2);
}
int num, x, y;
int level[15005];
int main()
{
while (scanf("%d",&num) != EOF)
{
memset(level,0,sizeof(level));
build(0,32000,0);
for (int i = 0; i < num; ++ i)
{
scanf("%d%d",&x,&y);
level[quary(0,x,0)] ++;
add(x,0);
}
for (int i = 0; i < num; ++ i)
printf("%d\n", level[i]);
}
}