poj2352 Stars(树状数组)

Stars

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 46476		Accepted: 20048

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递增；

直接用树状数组存左下方有几个星星（由于树状数组的性质，存的当然不直接是有几个 星星，读取的时候才是），注意，由于坐标可能为0，故操作的时候对坐标+1，最后减去的时候不影响结果；

（树状数组切忌出现坐标为0，因为0&-0始终=0，add里陷入死循环）

#include <iostream>
#include <iomanip>
#include<stdio.h>
#include<string.h>
#include<stack>
#include<stdlib.h>
#include<queue>
#include<map>
#include<math.h>
#include<algorithm>
#include<vector>
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
#define maxn 32005
const long long inf=1ll<<62;
using namespace std;
int a[maxn],level[maxn];
int n;
void add(int k,int num)
{
    while(k<=32001)
    {
        a[k]+=num;
        k+=k&-k;
    }
}
int read(int k)
{
    int sum=0;
    while(k)
    {
        sum+=a[k];
        k-=k&-k;
    }
    return sum;
}
int main()
{
        scanf("%d",&n);
        int x,y;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&x,&y);
            ++level[read(x+1)];
            add(x+1,1);
        }
        for(int i=0;i<n;i++)
            printf("%d\n",level[i]);
            return 0;
}