strars（树状数组）

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 48771		Accepted: 21075

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

POJ 2352

题目大意：给n个*，每个*都一个坐标（x,y)，问对于每个* ，其左下方共有多少个* （包含左下方同行，同列的* ）。

思路：

对y坐标从小到大排序，如果y相同，就按x坐标从小到大排序。相当于按x轴建立一维树状数组，然后求相当于它前面比它小的个数即可。大体就是每输入一个值，更新树状数组，即用sum（x）来表示这点属于具体的那一个区间内。属于那个区间，那个区间就++；

代码：

#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN=32000+100;
int c[MAXN];
int L[MAXN/2];   //L[2]=3 表示等级为2的点有3个
int lowbit(int x)
{
    return x&(-x);
}
int sum(int x)//x不能为0
{
    int res=0;
    while(x>0)
    {
        res +=c[x];
        x-=lowbit(x);
    }
    return res;
}
void add(int x,int v)//x>=1,切记x不能为0
{
    while(x<=MAXN)
    {
        c[x] +=v;
        x+=lowbit(x);
    }
}
int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        memset(c,0,sizeof(c));
        memset(L,0,sizeof(L));
        for(int i=0;i<n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            x++;//因为此处x可能为0
            L[sum(x)]++;
            add(x,1);//树状数组的x下标值是不能为0的,且要>=1
        }
        for(int i=0;i<n;i++)
            printf("%d\n",L[i]);
    }
    return 0;
}

心得：

代码很简单，关键是不好想。