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
分析
题中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,表明是一颗星的星等就是这颗星左下方(包括左和下)的星数。可以用树状数组和权值分块做,这里介绍树状数组的方法(比较慢),有空再介绍权值分块方法(比较快)。
一个x可能有多个y,用结构体更好表示。d数组维护结构体数组。
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int n,d[3200001],ji[1500001],m;
struct Point
{
int x,y;
};
Point star[1500001];
/*bool cmp(const POINT &a,const POINT &b)//这里题目输入就是按y升序输入,可以不用排序
{
if(a.x<b.x)
return true;
else if(a.x>b.x)
return false;
else if(a.y<b.y)
return true;
return false;
}*/
int lowbit(int x)
{
return x&(-x);
}
void update(int x,int a)//单点修改
{
for(;x<=m;x+=lowbit(x))
d[x]+=a;
}
int getsum(int x)//前缀和
{
int res=0;
for(;x>0;x-=lowbit(x))
res+=d[x];
return res;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&star[i].x,&star[i].y);
m=max(m,star[i].x);//找最大的x
}
for(int i=1;i<=n;i++)
{
update(star[i].x,1);
ji[getsum(star[i].x)-1]++;//记录级数,d数组的前缀和就是左下方共有几颗星星
}
for(int i=0;i<n;i++)
printf("%d\n",ji[i]);
return 0;
}