POJ 2352 stars 树状数组

Stars

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.

题意：给出N个星星在二维平面上的坐标x,y（坐标按y递增顺序给出，y相同时按x递增给出）。定义每个星星的level为横纵坐标均不超过自己的星星个数，依次给出level为0~N-1的星星分别有多少个。

因为按照y递增给出，所以第i颗星星等级就是之前出现过的星星中x坐标小于等于它的x坐标的星星数量，利用树状数组求和最合适。（为防止出现x=0，每一个x均执行x++右移一位）

#include<iostream>
#include<cstdio>

using namespace std;
const int maxn = 32001;
int level[maxn], c[maxn];
int lowbit(int x)
{
	return x&(-x);
}
int sum(int x)
{
	int sum = 0;
	while (x>0)
	{
		sum += c[x];
		x -= lowbit(x);
	}
	return sum;
}
void update(int pos)
{
	while (pos <= maxn)
	{
		c[pos]++;
		pos += lowbit(pos);
	}
}
int main()
{
	int n,x,y;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d %d", &x, &y);
		x++;
		level[sum(x)]++;
		update(x);
	}
	for (int i = 0; i < n; i++)
	{
		printf("%d\n", level[i]);
	}
	return 0;
}