# POJ 2352 Stars

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<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,c[32005],level[15005];
int lowbit(int x)
{
return x&(-x);
}
int sum(int pos)
{
int ans=0;
while(pos)
{
ans+=c[pos];
pos-=lowbit(pos);
}
return ans;
}
{
while(pos<=32001)//因为之前x++，所以是32001
{
c[pos]++;
pos+=lowbit(pos);
}
}
int main()
{
scanf("%d",&n);
int x,y;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
level[sum(++x)]++;//防止0的出现,刚学树状数组,没有注意到这一点,会导致TLE
}
for(int i=0;i<=n-1;i++)
printf("%d\n",level[i]);
return 0;
}``````

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

## POJ-2352-Stars

POJ-2352-Stars http://poj.org/problem?id=2352 给出n个星星的坐标，如果一个星星的左下方（包含正左和正下）有k颗星星，就说这颗星星是k级的，统计每个等级...
• Cambridgeacm
• 2012年07月22日 15:15
• 1428

## Poj（2352）——Stars（树状数组）

Description Astronomers often examine star maps where stars are represented by points on a plane ...
• 2015年05月30日 15:31
• 838

## poj 2352 Stars(树状数组 or 线段树)

• shuangde800
• 2012年11月12日 17:21
• 5694

## POJ-2352 Stars【树状数组】

• niushuai666
• 2012年03月24日 07:54
• 2803

## POJ2352:Stars(树状数组)

Description Astronomers often examine star maps where stars are represented by points on a plane ...
• libin56842
• 2015年06月21日 16:44
• 1535

## [ACM] hdu 2352 Stars （树状数组）

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30272   Accepte...
• sr19930829
• 2014年04月19日 20:53
• 1429

## POJ 2352 Stars 树状数组

StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13167 Accepted: 5654DescriptionAstron...
• hqd_acm
• 2010年07月08日 10:12
• 362

## POJ 2352 Stars【树状数组】

#include #include #include #include #include #include #include #define FOR(i,n) for(int i=0;i
• u012469987
• 2014年08月11日 01:37
• 316

## POJ - 2352 Stars

• flx413
• 2017年05月17日 21:43
• 203

## poj 2352 stars 树状数组

• buctyyzyn
• 2015年03月27日 18:25
• 260

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