Stars
来源:互联网 发布:hive group 数据倾斜 编辑:程序博客网 时间:2024/06/05 21:51
【题目描述】
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.
【输入格式】
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.
【输出格式】
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.
【样例输入】
51 15 17 13 35 5
【样例输出】
12110
【分析】
几乎是裸的树状数组啊~
#include<cstdio>#include<cstring>#define lowbit(x) x&(-x)const int N=32005;int sum[N], level[N];int query(int x){ int s=0; while(x){ s+=sum[x]; x-=lowbit(x); } return s;}void add(int x){ while(x<N){ sum[x]++; x+=lowbit(x); }}int main(){ int n,x,y; while(~scanf("%d",&n)){ memset(sum,0,sizeof(sum)); memset(level,0,sizeof(level)); for(int i=0;i<n;i++){ scanf("%d%d",&x,&y); level[query(x+1)]++; add(x+1); } for(int i=0;i<n;i++) printf("%d\n",level[i]); }}
- stars
- Stars
- Stars
- Stars
- Stars
- Stars
- Stars
- Stars
- stars
- Stars
- Stars
- stars
- Stars
- Stars
- Stars
- 7stars
- PKU2352 stars
- hdu1541 Stars
- HDU 2188(...选拔志愿者) 巴什博弈 Java
- 计算一个字符串数字的个数
- LeetCode 70. Climbing Stairs 动态规划问题
- C#189课的主要内容
- linux root的shell恢复
- Stars
- android studio 导入共享库,本地外部库
- 获取手机的联系人
- 欢迎使用CSDN-markdown编辑器
- CM自带ROOT请求处理流程
- Java运算符总结
- php的五十个提高效率小技巧
- ConcurrentHashMap原理
- 代码块