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.
由于按y坐标升序 ,y相同按x升序
所以直接按x边读入,进行查询即可,
因为每次只要查询之前坐标小于等于x的数量就能满足y小于等于当前(因为y升序)左边且x小于等于当前坐标。
这个过程用树状数组维护
注意更新x取得上限与维护数组的最大值有关而非n。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
//#include<bits/stdc++.h>
using namespace std;
const int M = 32000+199;
int n;
int c[M];
int lowbit(int x)
{
return x&(-x);
}
void add(int x,int d)
{
while(x<=M)//注意这里x最大加到的值其实是32000而不是15000
{
c[x]+=d;
x+=lowbit(x);
}
}
int getsum(int x)
{
int ans=0;
while(x)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}
int num[M];
int main()
{
cin>>n;
int l,r;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&l,&r);
l++,r++;
add(l,1);
int q=getsum(l);
// printf("%d----\n",q);
num[q]++;
}
for(int i=1;i<=n;i++)
printf("%d\n",num[i]);
return 0;
}