Stars(线段树)

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 49231		Accepted: 21246

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.

tips：每次做线段树都不能1A，做了半晚上这个题。

说下思路吧，就是求一个点 的 左下角有多少点。

因为题目是根据y的递增顺序输入的，所以我们只需要将x看成区间即可。因为y肯定是递增的。

线段树结点值代表：当前x的区间的点的 个数。

ans[i]=j;代表第i层的点的个数有j个。

对于i的求法，每当插入一个点，统计他前面的点的总个数；即是当前点所处的层数；

注意xy的最大值达到32000；意思叶子结点最多32000；线段树的结点最多是其4倍；

本boy就是因为数组开小了，想了半天才搞出来；希望以后做线段树的题目能 越来越顺手~

#include<iostream>
#include<cstring>
#include<cstdio> 
using namespace std;
const int maxn=32767;
const int mmax=33767;
int n;
int ans[maxn<<2];
int sum[maxn<<2];

void pushup(int rt)
{
	sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
int query(int rt,int l,int r,int ll,int rr)
{
	if(ll<=l&&rr>=r){
		return sum[rt];
	}
	int ret=0;
	int m=(l+r)>>1;
	if(ll<=m)ret+=query(rt<<1,l,m,ll,rr);
	if(rr>m)ret+=query(rt<<1|1,m+1,r,ll,rr);
	return ret;
}
void update(int rt,int l,int r,int x)
{
	if(l==r){
		sum[rt]++;
		return;
	}
	int m=(l+r)>>1;
	if(x<=m)update(rt<<1,l,m,x);
	else update(rt<<1|1,m+1,r,x);
	pushup(rt);
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int x,y;scanf("%d %d",&x,&y);
		ans[query(1,0,mmax,0,x)]++;
		update(1,0,mmax,x);
	}
	for(int i=0;i<n;i++)cout<<ans[i]<<endl; 
	
	
	return 0;
}