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 file 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.

Sample Input

5
1 1
5 1
7 1
3 3
5 5

Sample Output

1
2
1
1
0

Hint

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

 

星星有坐标，设一颗星星的左边为（a,b）,那么他的level就是满足x<a&&y<b的星星个数，用树状数组，树状数组从下标1开始，所以输入x坐标应该加1。

 

代码：

#include <iostream>
#include <cstdio>
using namespace std;
int n,x,y;
int tree[],level[];
int lowbit(int t)
{
    return t&-t;
}
void update(int x,int y)
{
    for(int i = x;i <= ;i += lowbit(i))
    {
        tree[i] += y;
    }
}
int gettree(int x)
{
    int ans = ;
    for(int i = x;i > ;i -= lowbit(i))
    {
        ans += tree[i];
    }
    return ans;
}
int main()
{
    scanf("%d",&n);
    for(int i = ;i < n;i ++)
    {
        scanf("%d%d",&x,&y);
        x ++;
        level[gettree(x)] ++;
        update(x,);
    }
    for(int i = ;i < n;i ++)
    {
        printf("%d\n",level[i]);
    }
}