Stars

Stars

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 4   Accepted Submission(s) : 2

Problem Description

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
  
  

 

/**树状数组**/
#include <iostream>
#include <cstdio>

using namespace std;
#define lowbit(x) (x)&(-x)
#define maxn 15000<<2

int sum[maxn+10]={0};
int level[maxn+10]={0};
int n=32010;/**树状数组:区间大小必须要已知,未知的要进行估算,
因为元素更新是从下到上的,如果没有确定的上界,会导致某些靠后的区间无法修改**/

void change(int x)//add = 1
{
    while(x<=n)
    {
        sum[x]=sum[x]+1;
        x+=lowbit(x);/**低位技术**/
    }
}

int Query(int x)/**1~x,查询前缀和**/
{
    int ans=0;
    while(x>0)
    {
        ans+=sum[x];
        x-=lowbit(x);
    }
    return ans;
}

int main()
{
    int N;
    scanf("%d",&N);
    for(int i=0;i<N;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        x++;/**原题给的坐标中会出现 0，而树状数组是从1开始的！所以，所有x+1，就可使所有数据不从0开始**/
        level[Query(x)]++;
        change(x);

    }
    for(int i=0;i<N;i++)
        printf("%d\n",level[i]);
    return 0;
}