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
5 1 1 5 1 7 1 3 3 5 5
Sample Output
1 2 1 1 0
解题思路:
题目一开始没看懂,读了半天才知道大意是:每颗星星都有坐标,且不重复,每颗星星的等级值即为x,y坐标不大于该星星的所有星星数目,还是挺拗口的。。。。。
该题也是树状数组的应用。由于是按y从小到大的顺序输入的,所以我们不需要考虑y的大小,即当输入一个坐标时,前面输入的坐标的y不会大于它。需要注意的是,该题的x是可以等于0的,而树状数组的下标是从1开始的。所以要对x进行+1处理。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn1 = 32005, maxn_2 = 15005;
int c[maxn1], level[maxn_2], n; // c存数的是坐标x上星星的数目,level是该等级上星星的数目
int lowbit(int a)
{
return a & (-a);
}
void Update(int a)
{
while(a < 32005)
{
c[a]++;
a += lowbit(a);
}
}
int Sum(int i)
{
int sum = 0;
while(i > 0)
{
sum += c[i];
i -= lowbit(i);
}
return sum;
}
int main()
{
int x, y;
scanf("%d", &n);
memset(c, 0, sizeof(c));
memset(level, 0, sizeof(level));
for(int i = 0; i < n; i++)
{
scanf("%d%d", &x, &y);
level[Sum(x + 1)]++; // Sum先求出该坐标之前星星的数目即等级
Update(x + 1); // 对星星的数目进行更新
}
for(int i = 0; i < n; i++)
printf("%d\n",level[i]);
return 0;
}