Stars -树状数组

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.

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. 

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.

5
1 1
5 1
7 1
3 3
5 5

1
2
1
1
0

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

题目的大致意思是：平面上有一个平面坐标系，然后有一些地方有星星，星星的左下角包括正左和正下方，有几颗星星那么这个行星就是几级的星星，最后输出从0级到N-1级的星星有多少个！

说实话，我事先知道这道题用树状数组做（专题训练），但想了想却不懂怎么用！

最后经过弱菜见不得人的努力以及同学的提醒，终于还是A了，可还是不明白这道题为什么要那么做，今天回头再去做专题的时候终于相明白了！（PS：可见复习是多么美好的事）

好，接下来转入正题。关于本题其实只要理解它的操作原理，就没问题了！

因为题目中的星星是以  X 从小到大的顺序输入坐标的，而且求的是每个星星的左下角以及正左正下的星星个数，所以可以把 Y 坐标看做没有，而把二维的平面坐标压缩成一维坐标，那么当前输入的星星的等级就是一维数组中从开始到当前星星的位置，每个下标对应的值之和！

因为X的值会很大，而压缩的一维坐标就和树状数组的a数组一样，星级就是对应C数组的值，所以这里用树状数组来解决这个问题！

关于树状数组，点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接 点击打开链接

附AC代码：

#include <stdio.h>
#include <string.h>

int X,Y;
int a[32222],c[32222];
int s[32222];

int lowbit(int x)
{
    return x&(-x);
}

void update(int x,int num)
{
    while(x<=32220)
    {
        c[x]+=num;
        x+=lowbit(x);
    }
}

int get_sum(int x)
{
    int sum=0;

    while(x>0)
    {
        sum+=c[x];
        x-=lowbit(x);
    }

    return sum;
}

int main()
{
    int T;
    int i,j;

    while(~scanf("%d",&T))
    {
        memset(s,0,sizeof(s));
        memset(a,0,sizeof(a));
        memset(c,0,sizeof(c));

        for(i=0;i<T;i++)
        {
            scanf("%d%d",&X,&Y);
            s[get_sum(X+1)]++;
            update(X+1,1);
        }

        for(i=0;i<T;i++)
            printf("%d\n",s[i]);
    }

    return 0;
}