题目
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.
题目大意
给你n个点的坐标(按照y为第一字典序,x为第二字典序给出),求每个点的左下方(包括左方和下方)有多少个点
题解
定义a[i]表示当前横坐标为i的点的个数,并且按照题目顺序来读入点,可以发现
某次读入点的左下角点的个数为a[1]+…+a[i],然后在让a[i]++,复杂度为O(MN)(M为横坐标最大值),可以想到用树状数组来优化,但要注意当x=0时的情况(可以让所有x+1)。
代码
#include <iostream>
using namespace std;
const int N = 15010;
int a[N*4],ans[N],n;
int lowbit(int x)
{
return x&-x;
}
void add(int x, int k)
{
while(x <= 32001)
{
a[x] += k;
x = x+lowbit(x);
}
}
int query(int x)
{
int ans = 0;
while(x)
{
ans += a[x];
x -= lowbit(x);
}
return ans;
}
int main()
{
int x,y;
cin >> n;
for(int i = 1; i <= n; i ++)
{
scanf("%d%d",&x,&y);
x ++;
int t = query(x);
ans[t]++;
add(x,1);
}
for(int i = 0; i < n; i++)
printf("%d\n",ans[i]);
return 0;
}