URAL 1028 数星星题解

最新推荐文章于 2022-03-25 15:59:23 发布

ssl_yty

最新推荐文章于 2022-03-25 15:59:23 发布

阅读量508

点赞数

分类专栏：树状数组

本文链接：https://blog.csdn.net/qq_45621109/article/details/108072856

版权

该博客介绍了URAL 1028数星星问题，这是一个关于天文学家如何计算星图中星星等级的问题。博客内容包括题目描述、输入输出格式、样例、题意解析、解题思路以及代码实现。主要考察的是通过排序后的坐标判断星星的等级，并统计各级星星的数量。

摘要由CSDN通过智能技术生成

URAL 1028 数星星题解

URAL 1028

题目

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.
Problem illustration

在这里插入图片描述
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.

输入

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.

输出

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.