POJ2352-Stars
2017-04-19 15:34
288 查看
Stars
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 46469 Accepted: 20046
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
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.
Source
Ural Collegiate Programming Contest 1999
题目大意:星星的级别为其左下的星星个数,求各个级别的星星数目
解题思路:由于按y升序再x升序给出点的坐标,故可用树状数组,每读一颗星星,求level[前缀和]++,在array indices=x的位置加一,注意树状数组从1开始。
#include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> using namespace std; const int MAXN=32005; int c[MAXN],level[MAXN]; inline int lowbit(int x) { return(x&(-x)); } int sum(int x) { int ret=0; while(x>0) { ret+=c[x]; x-=lowbit(x); } return ret; } void add(int x,int d) { while(x<=MAXN) { c[x]+=d; x+=lowbit(x); } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; while(cin>>n) { memset(level,0,sizeof(level)); memset(c,0,sizeof(c)); int x,y; for(int i=1;i<=n;i++) { cin>>x>>y; x++; level[sum(x)]++; add(x,1); } for(int i=0;i<n;i++) cout<<level[i]<<endl; } return 0; }
相关文章推荐
- poj_2352 Stars ( 线段树)
- 树状数组 POJ 2352 HDU 1541 Stars
- poj2352 Stars(树状数组)
- POJ 2352 Stars
- POJ 2352 Stars 线段树
- poj 2352 Stars
- POJ 2352 Stars(简单树状数组)
- POJ 2352 Stars(树状数组)
- POJ 2352 Stars (树状数组)
- poj 2352 Stars(简单树状数组)此题也可以用线段树来做
- Poj 2352 Stars
- POJ 2352 Stars 初学树状数组
- POJ 2352 HDU1541 Stars(树状数组)
- POJ 2352 Stars 题解
- POJ2352 Stars
- 【原】 POJ 2352 Stars 树状数组 解题报告
- POJ 2352 Stars
- POJ 2352 Stars 树状数组
- POJ 2352 Stars
- POJ 2352 Stars