版本6和7间的区别
于2006-04-21 20:28:22修订的的版本6
大小: 2505
编辑: czk
备注:
于2008-02-23 15:37:05修订的的版本7
大小: 2509
编辑: localhost
备注: converted to 1.6 markup
删除的内容标记成这样。 加入的内容标记成这样。
行号 11: 行号 11:
attachment:stars.JPG {{attachment:stars.JPG}}

Stars

http://acm.timus.ru/problem.aspx?space=1&num=1028

Time Limit: 1.0 second

Memory Limit: 1 000 KB

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.

stars.JPG

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.

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

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

3. Sample Input

1 1
5 1
7 1
3 3
5 

4. Sample Output

timus1028 (2008-02-23 15:37:05由localhost编辑)

ch3n2k.com | Copyright (c) 2004-2020 czk.