树状数组的进阶运用（Stars 数星星）

最新推荐文章于 2022-12-07 10:05:17 发布

forever_piano

最新推荐文章于 2022-12-07 10:05:17 发布

阅读量778

点赞数

本文链接：https://blog.csdn.net/u013672056/article/details/76219072

版权

这篇博客探讨了如何使用树状数组解决天文学中的星星等级分布问题。通过建立c[x]来记录横坐标小于等于x的星星数量，利用树状数组的特性进行高效统计，从而求解各等级星星的数目。

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

英文原题

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.