HDU：1541 Stars（树状数组）

Stars

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8537    Accepted Submission(s): 3408

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.

 

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
  
  

 

Source

Ural Collegiate Programming Contest 1999

 

Recommend

LL

 

题目大意：给你n个星星的坐标，给坐标的时候y按照递增顺序输入的，问你有多少个星星左下角有0个星星，多少个星星左下角有1个星星....多少个星星左下角有n-1个星星。

解题思路：既然y是按照递增顺序输入的，题目还求的左下角星星个数，那么不需要考虑y，只需要考虑x即可，这么一来可以用树状数组的求区间个数的性质来写这道题了。

代码如下：

#include <cstdio>
#include <cstring>
int n;
int level[32005];//level[i]=x代表左下方有i个星星的星星有x个 
int c[32005];
int sum(int x)
{
	int s=0;
	while(x>0)
	{
		s=s+c[x];
		x=x-(x&(-x));
	}
	return s;
}
void update(int x)
{
	while(x<32005)//注意这里，不是n而是32005，因为n个坐标个数，而x的最大范围为32000 
	{
		c[x]=c[x]+1;
		x=x+(x&(-x));
	}
}
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		memset(c,0,sizeof(c));
		memset(level,0,sizeof(level));
		for(int i=0;i<n;i++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			x++;//树状数组不能处理为0的情况，这么做能避免 
			level[sum(x)]++;//统计该点左下角的数的个数，这个状态数+1 
			update(x);//更新上层结构 
		}
		for(int i=0;i<n;i++)
		{
			printf("%d\n",level[i]);
		}
	}
	return 0;
}