【POJ】2352 - Stars（树状数组）

最新推荐文章于 2017-03-03 14:05:11 发布

wyg1997

最新推荐文章于 2017-03-03 14:05:11 发布

阅读量376

点赞数

分类专栏：树状数组

本文链接：https://blog.csdn.net/wyg1997/article/details/52988834

版权

树状数组专栏收录该内容

7 篇文章 0 订阅

订阅专栏

题目链接：点击打开链接

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 44063		Accepted: 19120

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.

Source

Ural Collegiate Programming Contest 1999

室友都睡了，不详细贴题解了，百度一下说的很明白。

用树状数组过，注意x坐标的+1，还有MAXX使用时候的+1。

代码如下：

#include <cstdio>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define LL long long
#define MAX 32000
int num[MAX+11];
int v[MAX+11];
int sum(int n)
{
	int sum = 0;
	while (n)
	{
		sum += num[n];
		n -= n & (-n);
	}
	return sum;
}
void add(int x)
{
	while (x <= MAX+1)		//啊啊这里忘了+1，wa了3次了！ 
	{
		num[x]++;
		x += x & (-x);
	}
}
int main()
{
	int n;
	while (~scanf ("%d",&n))
	{
		CLR(num,0);
		CLR(v,0);
		for (int i = 1 ; i <= n ; i++)
		{
			int x,y;
			scanf ("%d %d",&x,&y);
			x++;		//都加1避免下标0的出现 
			v[sum(x)]++;
			add(x);
		}
		for (int i = 0 ; i < n ; i++)
			printf ("%d\n",v[i]);
	}
	return 0;
}