POJ 2352 Stars(简单树状数组)

原创 2014年02月22日 21:16:01

什么是树状数组在这里就不说了啊,这里有解释了啊。http://blog.csdn.net/fulongxu/article/details/19701281

就是一个模版题目,直接套模版都可以过。先建数组,再求和。

由于y坐标是升序的且坐标不重复,所以在星星A后面输入的星星的x,y坐标不可能都小于等于星星A。假如当前输入的星星为(3,3),易得我们只需要去找树状数组中小于等于3的值就可以了

Stars
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 29336   Accepted: 12829

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
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#define eps 1e-7
#define M 10001000
#define LL __int64
//#define LL long long
#define INF 0x3f3f3f3f
#define PI 3.1415926535898
const int maxn = 50000;

using namespace std;

int c[maxn];
int vis[maxn];

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

void add(int x)
{
    while(x < maxn)
    {
        c[x]++;
        x += lowbit(x);
    }
}

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

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int x, y;
        memset(vis, 0 , sizeof(vis));
        for(int i = 0; i < n; i++)
        {
            scanf("%d %d",&x, &y);
            x++;
            y++;
            vis[sum(x)]++;
            add(x);
        }
        for(int i = 0; i < n; i++)
            cout<<vis[i]<<endl;
    }
    return 0;
}


相关文章推荐

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)...

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

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 34244   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
  • 884

POJ 2352 Stars (线段树&&树状数组)

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

POJ 2352 Stars(树状数组)

F - Stars Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Statu...
  • s1124yy
  • s1124yy
  • 2016年05月13日 15:49
  • 183

Poj(2352)——Stars(树状数组)

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

ACM-树状数组之Stars——hdu1541,poj2352

ACM 树状数组 Stars hdu1541 poj2352

POJ 2352 Stars 树状数组

题意:有很多给定坐标的星星,求每个星星左下方的星星数。 题解:用树形数组解。因为输入时y是升序,只要x1 >= x2 就可行。所以可以将二维视作一维,只考虑x就可以了。另外需要注意的是,树形数组不能...
  • Tsaid
  • Tsaid
  • 2011年07月23日 22:17
  • 317
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 2352 Stars(简单树状数组)
举报原因:
原因补充:

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