poj Stars

最新推荐文章于 2021-08-20 18:19:19 发布

zx-123

最新推荐文章于 2021-08-20 18:19:19 发布

阅读量404

点赞数

分类专栏：树状数组

本文链接：https://blog.csdn.net/u013952912/article/details/25110145

版权

树状数组专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 30540		Accepted: 13339

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

#include <stdio.h>

#include <string.h>
int level[15005]; //下标为等级数
int tree[32005]; //下标为横坐标
int lowbit(int x)
{
return x & -x;
}

void update(int x)
{
int i;
for (i=x; i<=32004; i += lowbit(i))
tree[i] += 1;
}

int Sum(int x)
{
int i,sum = 0;
for (i=x; i>=1; i -= lowbit(i) )
sum += tree[i];
return sum;
}

int main()
{
int i,x,y,n;
memset(tree,0,sizeof(tree));
memset(level,0,sizeof(level));
scanf("%d",&n);
for (i=1; i<=n; i++)
{
scanf("%d%d",&x,&y);
x++;
level[Sum(x)]++;
update(x);
}
for (i=0; i<n; i++)
printf("%d\n",level[i]);
return 0;
}