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.
题意
大概是给几组星星的坐标,不会有重复的,规定在其左下方的所有星星之和为其等级,然后输出0~n-1的级别的星星数。
思路
题目已经按照其y坐标从小到大的顺序排列输入,所以很明显的树状数组不需要排列,一个坑点就是,坐标是从0开始,所以要对每个坐标+1处理。
代码
#include<cstdio>
#define maxn 15005
using namespace std;
int tr[maxn<<2]={0};
int ans[maxn]={0};
int lowbit(int x)
{
return x&(-x);
}
void add(int x,int v)
{
while(x<maxn<<2)
{
tr[x]+=v;
x+=lowbit(x);
}
}
int sum(int x)
{
int s=0;
while(x)
{
s+=tr[x];
x-=lowbit(x);
}
return s;
}
int main()
{
int n;
scanf("%d",&n);
int x,y;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
x+=1;
ans[sum(x)]++;
add(x,1);
}
for(int i=0;i<n;i++)printf("%d\n",ans[i]);
return 0;
}