poj2352 Stars (树状数组)

最新推荐文章于 2020-07-28 22:29:13 发布

原创最新推荐文章于 2020-07-28 22:29:13 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个天文学问题的算法解决方案，即统计二维平面上星星坐标构成的地图中各层级星星的数量。利用输入数据的特点（按Y轴升序排列，相同Y坐标按X轴升序排列），通过树状数组实现高效计算每个星星的层级。

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 44895		Accepted: 19493

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

Sample Output

Hint

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

题意：给你几个星星的坐标，让你求在0－N-1层的星星的个数，等级＝左下方星星的个数。

因为给出的数据是按照y轴从小到大的，给出的坐标的等级只与它之前的数所决定，并且只需要看x的大小关系，用树状数组。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int c[32005];
int level[15005];
int lowbit(int x)
{
	return x&(-x);
}
void add(int x)
{
	while(x<=32005)//不能为32000，我也不知道为啥
	{
		c[x]+=1;
		x+=lowbit(x);
	}
}
int sum(int x)
{
	int s=0;
	while(x>0)
	{
		s+=c[x];
		x-=lowbit(x);
	}
	return s;
}
int main()
{
	int n;
	scanf("%d",&n);
	memset(c,0,sizeof(c));
	memset(level,0,sizeof(level));
	for(int i=0;i<n;i++)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		a++;
		level[sum(a)]++;
		add(a);
	}
	for(int i=0;i<n;i++)
	{
		printf("%d\n",level[i]);
	}
	return 0;
}