不懂英语的直接点这里。
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.
题目大意
给定一个星座的直角坐标图,每个星星都有一个坐标值(x,y)(0<=X,Y<=32000);其中输入中的y是不下降的,对于y相同的情况,则按x不下降的顺序给出。
给出N(1<=N<=15000)个星星的坐标,输出等级分别为0,1,2 3,4,…的星星的个数。星星的等级的定义是:如果有m个星星的坐标(x,y)均小于等于该星星的坐标(x0,y0)则该星星的等级为m(m中不包含该星星本身)。
分析
因为这道题的数据规模较大,可以使用树状数组来解决。
依次读入输入数据,只处理其x值即可,即update(x,1),此时sum(x)-1即为此颗星星左下方的星星个数。
源代码
#include<cstdio>
#include<cstring>
#include<cstdlib>
#define lowbit(x) ((x)&(-x))
#define N 35000
#define M 16000
int c[N],ans[M];
int n;
void update(int p,int x){
while(p<=32001){
c[p]+=x;
p+=lowbit(p);
}
}
int sum(int p){
int sum=0;
while(p>0){
sum+=c[p];
p-=lowbit(p);
}
return sum;
}
int main()
{
int i,x,y;
scanf("%d",&n);
memset(c,0,sizeof(c));
memset(ans,0,sizeof(ans));
for(i=1;i<=n;i++){
scanf("%d%d",&x,&y);
ans[sum(x+1)]++;
update(x+1,1);
}
for(i=0;i<n;i++)
printf("%d\n",ans[i]);
}