poj 2352 树状数组
2016-03-20 15:59
357 查看
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.
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
Sample Output
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
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.
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
5 1 1 5 1 7 1 3 3 5 5
Sample Output
1 2 1 1 0
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
#include<stdio.h> #include<string.h> const int N = 32005; int sum , level ; int lowbit(int x) { return x & (-x); } int get_sum(int x) { int s = 0; while(x > 0) { s += sum[x]; x -= lowbit(x); } return s; } void update(int x) { while(x < 32005) { sum[x]++; x += lowbit(x); } } int main() { int n, x, y, i; while(~scanf("%d",&n)) { memset(sum, 0, sizeof(sum)); memset(level, 0, sizeof(level)); for(i = 0; i < n; i++) { scanf("%d%d",&x,&y); level[get_sum(x+1)]++; update(x+1); //更新sum[i]的值 } for(i = 0; i < n; i++) printf("%d\n",level[i]); } return 0; }
相关文章推荐
- hdu2044 一只小蜜蜂.
- 猎豹MFC--下拉框ComboBox 列表框ListBox
- hibernate3与hibernate4区别
- openssl 线程安全 Windows
- 堆和栈区别
- Java学习之InputStream中read()与read(byte[] b)
- Hibernate学习——(十)继承映射
- 记住,常量不能被修改。 尤其是字符串常量。
- 猎豹MFC--对话框 复选框 单选按钮
- JS异步加载的三种方式
- Jenkins+git+fir搭建持续集成环境(超详细搭建教程)
- 《leetCode》:Power of Three
- LeetCode-80-Remove Duplicates from Sorted Array II(递归)-Medium
- IOS自动布局之Autoresizing
- 【边喝caffee边Caffe 】(一)Caffe的安装
- 猎豹MFC--对话框 静态文本 编辑框 按钮 对话框 访问控件
- UITableView增加搜素框后搜不出来内容(old)
- hdu2037 今年暑假不AC
- myeclipse的buildpath 和lib引入的区别
- 浅谈HTTP中Get与Post的区别【转】