POJ 2352 数星星

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 53816		Accepted: 23159

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.

Source

Ural Collegiate Programming Contest 1999

****这是一道树状数组的题，根据题目可知，星星位置的顺序已经排好序了，所以对于本题来说y坐标的位置没有用，只需要一个一个星星判断他们的x坐标位置即可，由于不确定级数的范围大小，所以把级数直接设为最大可能行32001。由于树状数组的角标不能是0，所以把每个坐标的x值都加一，当然也可以加别的数字，但会增大数据范围。

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,i,j,k,u,v,ans[15005] ={0},tree[32001] = {0};
struct node
{
    int x;
    int y;
}a[15005];
int lowbit(int x)
{
    return x & (-x);
}
void add(int l,int x)
{
    while(l <= 32001)
    {
        tree[l] += x;
        l += lowbit(l);
    }
}
int sum(int p)
{
    int res = 0;
    while(p > 0)
    {
        res += tree[p];
        p -= lowbit(p);
    }
    return res;
}
int main()
{
    scanf("%d",&n);
    for(i = 1;i <= n;i++)
    {
        scanf("%d %d",&a[i].x,&a[i].y);
    }
    for(i = 1;i <= n;i++)
    {
        u = a[i].x + 1;
        v = sum(u);
        ans[v] += 1;
        add(u,1);
    }
    for(i = 0;i < n;i++)
    {
        printf("%d",ans[i]);
        if(i != n)
            printf("
");
    }
    return 0;
}