HDOJ 1541 Stars
来源:互联网 发布:服务器1433端口不通 编辑:程序博客网 时间:2024/06/03 07:18
Stars
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8425 Accepted Submission(s): 3369
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
Source
Ural Collegiate Programming Contest 1999
Recommend
LL
树状数组的基本运用吧。主要是要看懂题= =
这个(点我0。0)是别人的分析,写的很全面又有翻译。不明白的话可以看这个。
#include<stdio.h>#include<string.h>#define N 32000+10int c[N],ra[N];int lowbit(int x){return x&(-x);}void add(int x){while(x<N){c[x]++;x+=lowbit(x);}}int gsum(int x){int s=0;while(x>0){s+=c[x];x-=lowbit(x);}return s;}int main(){int n;int i,x,y;while(~scanf("%d",&n)){memset(c,0,sizeof(c));memset(ra,0,sizeof(ra));for(i=0;i<n;i++){scanf("%d%d",&x,&y);ra[gsum(x+1)]++;add(x+1);}for(i=0;i<n;i++)printf("%d\n",ra[i]);}return 0;}
0 0
- hdoj 1541 Stars
- HDOJ 1541 Stars
- 【树状数组】 HDOJ 1541 Stars
- HDOJ 1541 Stars(树状数组)
- HDOJ Stars 1541(树状数组)
- POJ 2352 HDOJ 1541 Stars(树状数组)
- hdoj-2428 stars
- HDOJ 2642 Stars
- HDOJ题目1541 Stars(树状数组单点更新)
- HDOJ 1541 Stars(线段树单点更新)
- hdoj Stars 1541 (树状数组模板&&线段树)
- hdoj 1541 Stars 【树状数组 线段树】【单点更新 区间求和】
- HDOJ-5277 YJC counts stars(DFS)
- hdoj 5533 Dancing Stars on Me
- HDOJ 5533 Dancing Stars on Me
- hdoj 5533 Dancing Stars on Me【数学】
- hdoj 5533 Dancing Stars on Me 【数学题】
- hdoj 5533 Dancing Stars on Me
- HashMap和Hashtable的实现原理
- poj 1045 Fire Net(重在建图,二分匹配)
- 0、计算机系统
- Java 方法
- 递归提取目录下的所有json格式的文件,重命名,并保存到另外的目录
- HDOJ 1541 Stars
- 51nod oj 1101 换零钱【完全背包】
- 在 Raspberry Pi 2/B+上安装OpenCV和Python
- 提升自己
- HDU:1513 Palindrome(回文字符串+最长公共子序列+滚动数组)
- windows下编译wget过程分享
- Uva 10820 Send a Table(数论、欧拉筛法)
- 在CentOS中安装redis3.0
- Http协议详解