POJ 2352 Stars

原创 2016年08月28日 14:35:06

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.


题目大意:
在坐标上有n个星星,如果某个星星坐标为(x, y), 它的左下位置为:(x0,y0),x0<=x 且y0<=y。如果左下位置有a个星星,就表示这个星星属于level x
按照y递增,如果y相同则x递增的顺序给出n个星星,求出所有level水平的数量。

分析与总结:
因为输入是按照按照y递增,如果y相同则x递增的顺序给出的, 所以,对于第i颗星星,它的level就是之前出现过的星星中,横坐标x小于等于i星横坐标的那些星星的总数量(前面的y一定比后面的y小)。
所以,需要找到一种数据结构来记录所有星星的x值,方便的求出所有值为0~x的星星总数量。
与树状数组求逆序对的思路差不多。


#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,c[32005],level[15005];
int lowbit(int x)
{
    return x&(-x);
}
int sum(int pos)
{
    int ans=0;
    while(pos)
    {
        ans+=c[pos];
        pos-=lowbit(pos);
    }
    return ans;
}
void add(int pos)
{
    while(pos<=32001)//因为之前x++,所以是32001
    {
        c[pos]++;
        pos+=lowbit(pos);
    }
}
int main()
{
    scanf("%d",&n);
    int x,y;
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&x,&y);
        level[sum(++x)]++;//防止0的出现,刚学树状数组,没有注意到这一点,会导致TLE 
        add(x);
    }
    for(int i=0;i<=n-1;i++)
        printf("%d\n",level[i]);
    return 0;
}
版权声明:本文章的作者才疏学浅,有错误或疏漏是在所难免的,希望读者能帮助发现错误并提出建议。

相关文章推荐

poj-2352-Stars【树状数组】

题目链接:点击打开链接 Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: ...

POJ 2352 stars

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

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

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

POJ - 2352 - Stars (树状数组!!)

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 34244   Accepte...

poj 2352 Stars

一道树状数组的基础题 由于星星是按纵坐标升序 横坐标升序排列的,所以后面的点不会在前面的点的下面,也不会在前面的点的左边 所以某一点i 的level就是它前面的星星的数量和,即从0到i 的和,由于0会...
  • deng_yu
  • deng_yu
  • 2011年08月04日 16:15
  • 101

POJ2352 Stars

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 23703   Accepte...

POJ2352 Stars 【树状数组】or【线段树】

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 31172   Accepte...

POJ-2352-Stars-树状数组

树状数组中,每个结点管辖了不同的原数组元素的和。 令A[1...n]表示原数组,C[1...n]表示树状树组。 观察图,可知: C1 = A1 C2 = A1 + A2 C3 = A...
  • lihao21
  • lihao21
  • 2011年03月28日 22:39
  • 900

POJ 2352 Stars(简单树状数组)

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

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

题目大意:给你一个二维的坐标系(32000*32000),里面有n(15000)个点,告诉你每个点的坐标(各个点各不相同)。定义:(x0,y0)(x_0,y_0)的左下角区域为:{(x,y)(x,y)...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 2352 Stars
举报原因:
原因补充:

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