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
  • 下载

用Github的Api发现stars最多开源项目

Github的API无需注册,在网上可以查到使用信息和一些限制: 查询的请求为每分钟10次 此次用到的api格式如下:url = ‘https://api.github.com/search/re...

pku2482--Stars in Your Window

  • 2010年09月19日 11:30
  • 4KB
  • 下载

HDU1541:Stars(线段树单点更新)

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

POJ 2352 Stars(线段树单点更新)

题解转自该博客 http://blog.csdn.net/shuangde800/article/details/8175139题意: 在坐标上有n个星星,如果某个星星坐标为(x, y), 它的...

山东省第六届 ACM 省赛 Stars (尺取法)

Problem Description There are N (1 ≤ N ≤ 400) stars in the sky. And each of them has a unique coor...

poj 2352 Stars(树状数组)

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

POJ 2352 Stars(简单树状数组)

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

UVA 12493 Stars (欧拉函数--求1~n与n互质的个数)

https://uva.onlinejudge.org/index.phpoption=com_onlinejudge&Itemid=8&category=279&page=show_problem&...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PUOJ_Stars
举报原因:
原因补充:

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