Stars（树状数组）

　　　　　　　　　　　　　　　　　　　　　　　　　 Stars

Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astronomers want to know the distribution of the levels of the stars.

For example, look at the map shown on the figure above. Level of the star number 5 is equal to 3 (it's formed by three stars with a numbers 1, 2 and 4). And the levels of the stars numbered by 2 and 4 are 1. At this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3.

You are to write a program that will count the amounts of the stars of each level on a given map.

Input

The first line of the input contains a number of stars N (1 ≤ N ≤ 15000). The following N lines describe coordinates of stars (two integers X and Y per line separated by a space, 0 ≤ X, Y ≤ 32000). There can be only one star at one point of the plane. Stars are listed in ascending order of Y coordinate. Stars with equal Y coordinates are listed in ascending order of X coordinate.

Output

The output should contain N lines, one number per line. The first line contains amount of stars of the level 0, the second does amount of stars of the level 1 and so on, the last line contains amount of stars of the level N−1.

Example

input	output
5 1 1 5 1 7 1 3 3 5 5	1 2 1 1 0

 题意：定义星星的等级为在它左下角（包括正左和正下）的星星的个数。给出若干个星星的坐标（不超过15000个），输出各个等级的星星分别有多少个。每个星星的坐标不超过32000，输入时按照Y坐标升序输入。

因为按照Y坐标升序输入，所以放入一个点后，不会影响到等级比他大的点的个数，所以和它同等级的点的个数应该加一

#include<stdio.h>
#include<string.h>
#define lowbit(a) ((a)&(-a))
#define maxn　32001//x轴最大范围

int c[120000],ans[120000];//ans[i]为等级为i＋1的星星的数量

void add(int num)//c[num]+1
{
    int i;
    for(i = num; i <= maxn; i += lowbit(i))
    {
        c[i] ++;
    }
}

int  sum(int n)//前n个数求和
{
    int i,ans = 0;
    for(i = n; i > 0; i -= lowbit(i))
    {
        ans += c[i];
    }
    return ans;
}

int main()
{
    int i,n,t,x,y;
    scanf("%d",&n);
    memset(c,0,sizeof(c));
    memset(ans,0,sizeof(ans));
    
    for(i = 1; i <= n; i ++)
    {
        scanf("%d %d",&x,&y);
        x++;//让横坐标加一，避免出现 c[0]
        ans[sum(x)]++;//x属于的等级的个数+_1,因为题目按照纵坐标的顺序给点，此点的放入不会影响到等级比他大的点的个数
        add(x);//将此点放上
    }
    for(i = 0; i < n; i ++)
    {
        printf("%d\n",ans[i]);
    }

    return 0;
}