# POJ2352

Stars
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36355 Accepted: 15810

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.

#include<stdio.h>
#include<stdlib.h>
#define MAX 32005
int a[MAX]= {0},c[MAX]= {0};
int lowbit(int x)
{
return x&(-x);
}
int sum(int i)
{
int s;
while(i>0)
{
s=s+c[i];
i=i-lowbit(i);
}
return s;
}
{
while(x<=MAX)
{
++c[x];
x=x+lowbit(x);
}
}
int main()
{
int x,y,i,n;
scanf("%d",&n);
for(i=0; i<MAX; i++)
a[i]=c[i]=0;
for(i=0; i<n; i++)
{
scanf("%d%d",&x,&y);
a[sum(++x)]++;
}
for(i=0; i<n; i++)
{
printf("%d\n",a[i]);
}
return 0;
}


• 本文已收录于以下专栏：

## poj 2352 treap

//15000个坐标，对于每个坐标，其左下方向（含平 垂）坐标的个数就是它的level数 //输出各个level坐标个数 //之前做过线段树。。现在暴个treap #include #include...
• rptotal
• 2012年02月29日 16:44
• 991

## poj 2352（树状数组）

Stars Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus D...

## POJ 2352 stars

Description Astronomers often examine star maps where stars are represented by points on a plane ...

## POJ2352

POJ2299：这题其实有两个变量。position 和 value满足position1value2的一对数，是逆序的一对数。题目要我们求得是逆序数的总数。我们的求法是归并排序和树状数组。    ...

## 树状数组简单题（POJ2352，HDU1541）

POJ2352，HDU1541 Stars 给出N个点的X,Y坐标（按照Y升序，X升序的顺序给出），对于每个点输出有多少个点在该点的左下方。如图中的点5就有3个（1,2,4）点在它的左下方。...

## POJ - 2352 - Stars （树状数组！！）

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 34244   Accepte...

## poj 2352 Stars

• deng_yu
• 2011年08月04日 16:15
• 101

举报原因： 您举报文章：POJ2352 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)