Stars
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4966 Accepted Submission(s): 1966
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.
![](https://i-blog.csdnimg.cn/blog_migrate/fe1a27fe685322035ebcd08664e5becb.jpeg)
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/* 略感费解 ,,加油!!! Time:2014-10-19 15:32 */ #include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define MAX 32005 int ans[MAX],C[MAX]; int N; int lowbit(int x){ return x&(-x); } void add(int p,int val){ while(p<=MAX-1){//这儿不是1----N的值,而是1---MAX的值,在坐标范围之内的所有值,返回的是这个分布位置的水平,而范围不是在水平n的范围之内 C[p]+=val; p+=lowbit(p); } } int Query(int p){ int sum=0; while(p>0){ sum+=C[p]; p-=lowbit(p); } return sum; } int main(){ int x,y; while(scanf("%d",&N)!=EOF){ memset(ans,0,sizeof(ans)); memset(C,0,sizeof(C)); for(int i=0;i<N;i++){ scanf("%d%d",&x,&y);//因为是按y排序输入的,y相等的情况下按x排序 ans[Query(x+1)]++;//把1--x+1的所有和记下来就是这个点的水平 add(x+1,1); } for(int i=0;i<N;i++){//从水平0开始输出每个水平的个数,水平0 只有第一个 printf("%d\n",ans[i]); } } return 0; }