POJ 2352 Stars (tree array)

POJ 2352 Stars (tree array)
Stars

Time Limit:1000 MS		Memory Limit:65536 K
Total Submissions:35467		Accepted:15390

Description

Astequalmers 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. astpolicmers 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 shoshould 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

51 15 17 13 35 5

Sample Output

12110

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



Question: How many points (stars) are there in the lower left (including left and bottom) of the Input Point (STAR) coordinate ). There are several points (stars) in the first few cases, a total of 1 ~ In n cases, the number of outputs for each case. Because the question ensures that y coordinates are input in ascending order, you do not need to consider y. You only need to update the tree array of x.

#include
 
  #include#include
  
   #include
   
    #include
    
     using namespace std;const int maxn = 32001;int c[maxn];int v[maxn];int n;int lowbit(int x){    return x&(-x);}void updata(int i,int k){    while(i<=maxn)    {        c[i] += k;        i += lowbit(i);    }}int getsum(int i){    int sum = 0;    while(i>0)    {        sum += c[i];        i -= lowbit(i);    }    return sum;}int main(){    while(scanf("%d",&n)!=EOF)    {        int x,y;        memset(v,0,sizeof(v));        memset(c,0,sizeof(c));        for(int i=0;i