poj2352&hdu1541stars(树状数组)
来源:互联网 发布:ncbi sra数据库 编辑:程序博客网 时间:2024/06/12 01:48
poj2352stars
题目描述:
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.
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
51 15 17 13 35 5
Sample Output
12110题意:给出一些星星的横坐标和纵坐标,而且星星的纵坐标按递增排列,如果纵坐标相等,则横坐标按递增排列,任意两颗星星不会重合。如果有n颗星星的横坐标比某颗星星小而且纵坐标不大于那颗星星(即有n颗星星位于那颗星星的左下角或者左边)则此星星的等级为n,最后输出等级为0至n-1的星星的数量。分析:树状数组。题目给的数据按照y排序,相同的y按照x排序,这就给解题带来了很大的方便,我们可以直接在输入的时候来处理数据,将x+1添加到树状数组中(因为x有可能等于零所以要用x+1),tree[x]数组用来存储比x小的数有几个即level。
1 0
- poj2352&hdu1541stars(树状数组)
- POJ2352(树状数组)
- 树状数组(poj2352)
- poj2352 Stars (树状数组)
- POJ2352 Stars(树状数组)
- treap||树状数组(poj2352)
- poj2352 Stars(树状数组)
- poj2352 Stars(树状数组)
- 树状数组简单题(POJ2352,HDU1541)
- poj2352&&hdu1556&&poj2481(树状数组)
- poj2352——Stars(树状数组)
- POJ2352 Stars(树状数组 or SplayTree)
- Stars POJ2352(树状数组模板题)
- poj2352树状数组入门
- 【树状数组】 poj2352 Stars
- POJ2352 stars(树状数组)
- 简单树状数组-poj2352
- POJ2352(树状数组)
- MySQL Select-limit
- C语言经典算法13
- BOM编程-NODE
- 用Java写股票查询系统(小组同学的作业)
- Open CV 学习记录(一)
- poj2352&hdu1541stars(树状数组)
- 图片轮播框架的使用
- Effective C++读书笔记---透彻了解Inline函数
- 跨域-降域
- 文章标题
- sql 表占用空间查询
- C语言经典算法14
- poj3069Saruman's Army
- HDU 1166 敌兵布阵 伸展树splay简单练手题