# 【线段树】Stars

## 1028. Stars

Time Limit: 0.25 second
Memory Limit: 16 MB
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 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 output
5
1 1
5 1
7 1
3 3
5 5

1
2
1
1
0


1、没有建树，也许建树要快一点，因为这里范围有点大，1~32000,。

2、这里把查找和插入合并了，tree维护的是1~r这个区间点的数量

#include<cstdio>
#include<cstdlib>
using namespace std;

long k;long cnt[15010];
long tree[128010];

void insert(long l,long r,long i,long x)
{
long mid = (l+r)>>1;
if (l == r)
{
k += tree[i];
tree[i] ++;
return;
}
if (x <= mid)
{
insert(l,mid,i<<1,x);
tree[i] ++;
}
else
{
insert(mid+1,r,(i<<1)+1,x);
k += tree[i<<1];
tree[i] ++;
}
}

int main()
{
long n;

	scanf("%ld",&n);
for (long i=1;i<n+1;i++)
{
long x;k = 0;long tmp;
scanf("%ld%ld",&x,&tmp);
insert(1,32000,1,x);
cnt[k] ++;
}
for (long i=0;i<n;i++)
{
printf("%ld\n",cnt[i]);
}
return 0;
}


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

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