# Stars

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6775    Accepted Submission(s): 2698

Problem 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

Source

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=32010;
int c[maxn+10];
int vis[maxn+10];
int N;
int low(int n){
return n&(-n);
}
void add(int p,int q){
while(p<=maxn){
c[p]+=q;
p+=low(p);
}
}
int sum(int n){
int value=0;
while(n>0){
value+=c[n];
n-=low(n);
}
return value;
}
int main()
{
int i,j,k,ans,num;
while(scanf("%d",&N)!=EOF){
memset(c,0,sizeof(c));
memset(vis,0,sizeof(vis));
for(i=1;i<=N;++i){
scanf("%d%d",&num,&ans);
vis[sum(num+1)]++;
}
for(i=0;i<N;++i){
printf("%d\n",vis[i]);
}
}
return 0;
}

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

## 关于树状数组一些有意思的东西

• TA201314
• 2016年04月28日 09:23
• 1577

## 对树状数组的一点理解

• u012891242
• 2015年04月13日 17:01
• 1316

## 求逆序对 （树状数组版）

• u013923947
• 2014年08月18日 14:53
• 721

## 离散化+树状数组求逆序数

• ACdreamers
• 2013年01月19日 14:52
• 4233

## 详解树状数组 区间修改求和

• BlackJack_
• 2017年07月11日 20:22
• 929

## 树状数组求区间最大值

• u010598215
• 2015年09月04日 10:42
• 5141

## 树状数组与其应用（Python实现）（1）

• QHjust
• 2016年05月26日 15:28
• 472

## NOIP提高组——树状数组

• G1342522389
• 2017年08月24日 21:35
• 160

## hdu 5147 Sequence II（树状数组，前缀和，后缀和）

Sequence II Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...
• acm_cxq
• 2016年07月14日 23:01
• 432

## 【小结】树状数组的区间修改与区间查询

• qq_21841245
• 2015年02月26日 21:46
• 8981

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