HDU 1541 树状数组
来源:互联网 发布:淘宝联盟做推广多少钱 编辑:程序博客网 时间:2024/05/01 16:12
http://acm.hdu.edu.cn/showproblem.php?pid=1541
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.
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
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;const int MAX=50005;int a[MAX],level[MAX];void add(int i){ while(i<=MAX)//不能设置到n { a[i]+=1; i+=i&(-i); }}int sum(int i){ int sum=0; while(i>0) { sum+=a[i]; i-=i&(-i); } return sum;}int main(){ int n; while(~scanf("%d",&n)) { for(int i=0;i<n;i++) { int x,y; scanf("%d%d",&x,&y);//因为给出的输出全是x由小到大,而且y也是依次递增的 level[sum(x+1)]++; add(x); } for(int i=0;i<n;i++) printf("%d\n",level[i]); } return 0;}
0 0
- HDU 1541 树状数组
- HDU 1541 树状数组
- hdu(1541)(树状数组)
- HDU 1541 树状数组
- HDU 1541 Stars【树状数组】
- HDU-1541(树状数组入门)
- HDU 1541 star 树状数组
- hdu 1541 树状数组简单
- hdu 1541 Stars (树状数组)
- HDU 1541 Stars (树状数组)
- 【树状数组】hdu 1541 Stars
- hdu-1541 Stars-----> 树状数组
- hdu 1541 树状数组 Stars
- HDU 1541 Stars 树状数组
- hdu 1541 Stars(树状数组)
- hdu 1541 树状数组入门
- hdu 1541 Stars 树状数组
- 【HDU 1541 Stars 树状数组】
- JDBC 连接MYSQL数据库
- 查找整数
- 使用modern.IE来设计更现代化的网页
- 控制ExpandableListView某一项点击不展开
- DM6446学习的方法,刚学习第二天
- HDU 1541 树状数组
- IE11无法显示此页的问题
- myEclipse中光标异常
- 市委组织部考核项目——问题记录
- 类图关系表示
- 老调重弹,简单问题之 i++, ++i ,你真的清楚吗?
- cmdilistener1.3
- 数列特征
- IE11免费面向广大开发者