PUOJ_Stars

原创 2015年11月18日 19:41:07

                                                             Stars

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.




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

#define N 32005

int sum[N], level[N];

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

int get_sum(int x) 
{
    int s = 0;
    while(x > 0) 
    {
        s += sum[x];
        x -= lowbit(x);
    }
    return s;
}

void update(int x) 
{
    while(x < 32005) 
    {
        sum[x]++;
        x += lowbit(x);
    }
}

int main()
{
    int n, x, y, i;
    while(~scanf("%d",&n)) 
    {
        memset(sum, 0, sizeof(sum));
        memset(level, 0, sizeof(level));
        for(i = 0; i < n; ++i) 
        {
            scanf("%d %d",&x,&y);
            level[get_sum(x+1)]++;
            update(x+1); //更新sum[i]的值
        }
        for(i = 0; i < n; i++) 
            printf("%d\n",level[i]);
    } 
    return 0;
} 
//sum[i]表示x不大于i的点的数目


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

视觉测量V-STARS系统

  • 2012-09-26 15:41
  • 140KB
  • 下载

CMG-STARS使用指南

  • 2010-06-19 17:08
  • 997KB
  • 下载

D - Stars

Description Astronomers often examine star maps where stars are represented by points on a plane ...

pku2482--Stars in Your Window

POJ 2352 Stars(简单树状数组)

什么是树状数组在这里就不说了啊,这里有解释了啊。http://blog.csdn.net/fulongxu/article/details/19701281 就是一个模版题目,直接套模版都可以过。先建...

hduoj Stars 二维树状数组

话说这道题是一道不折不扣的二维树状数组的水题,可是对于我这种菜鸟中的vip来说,却还是纠结了很久很久。。留下做个模板吧。。。。。 题目: Yifenfei is a romantic gu...

poj 2352 Stars(树状数组)

StarsDescriptionAstronomers often examine star maps where stars are represented by points on a plane...

POJ - 2352 Stars解题报告(树状数组求二维区域和)

题目大意:给你一个二维的坐标系(32000*32000),里面有n(15000)个点,告诉你每个点的坐标(各个点各不相同)。定义:(x0,y0)(x_0,y_0)的左下角区域为:{(x,y)(x,y)...

hdu 5533 Dancing Stars on Me

Dancing Stars on Me Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/O...

POJ 2352 stars

Description Astronomers often examine star maps where stars are represented by points on a plane ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)