poj 2352 star 树状数组

狮子和猿

于 2012-05-04 02:04:59 发布

阅读量506

点赞数

CC 4.0 BY-SA版权

分类专栏： Data Struct、Algorithm and ACM 文章标签： output numbers input each file

本文链接：https://blog.youkuaiyun.com/cscj2010/article/details/7533413

Data Struct、Algorithm and ACM 专栏收录该内容

281 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

这篇博客详细介绍了如何解决POJ 2352编程问题，主要涉及使用星形树状数组来处理输入和输出数据，通过实例分析了算法的应用和实现。

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20885		Accepted: 9097

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 o