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【树状数组】

题目链接:http://poj.org/problem?id=2352 题目大意: 给你星星的坐标(y递增,若y相等,x递增),每个星星都有一个等级,规定它的等级就是在它左下方的星星的个数。输入所...
  • niushuai666
  • niushuai666
  • 2012年03月24日 07:54
  • 2798

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

Description Astronomers often examine star maps where stars are represented by points on a plane ...
  • ACMer_hades
  • ACMer_hades
  • 2015年05月30日 15:31
  • 838

POJ2352:Stars(树状数组)

Description Astronomers often examine star maps where stars are represented by points on a plane ...
  • libin56842
  • libin56842
  • 2015年06月21日 16:44
  • 1531

POJ-2352-Stars

POJ-2352-Stars http://poj.org/problem?id=2352 给出n个星星的坐标,如果一个星星的左下方(包含正左和正下)有k颗星星,就说这颗星星是k级的,统计每个等级...
  • Cambridgeacm
  • Cambridgeacm
  • 2012年07月22日 15:15
  • 1418

poj 2352 Stars(树状数组 or 线段树)

链接: http://poj.org/problem?id=2352 题目大意: 在坐标上有n个星星,如果某个星星坐标为(x, y), 它的左下位置为:(x0,y0),x0 按照y...
  • shuangde800
  • shuangde800
  • 2012年11月12日 17:21
  • 5680

[ACM] hdu 2352 Stars (树状数组)

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30272   Accepte...
  • sr19930829
  • sr19930829
  • 2014年04月19日 20:53
  • 1423

Stars POJ 2352(简单树状数组)

题目链接:http://poj.org/problem?id=2352 题目描述:给定n个星星的(x,y)坐标,定义每个星星(x,y)的level值为在左下角的星星(x0 思路:输入保证了y值一定是...
  • smwqd_yehua_cx
  • smwqd_yehua_cx
  • 2017年08月18日 23:43
  • 64

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

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 31172   Accepte...
  • u012846486
  • u012846486
  • 2014年07月13日 11:41
  • 955

POJ - 2352 Stars (树状数组)

题意:给你星星的坐标(Y递增,若Y相等则X递增),每个星星有个等级,规定它的等级是它左下方的星星个数,输出所有星星的等级 思路:树状数组 #include #include #include ...
  • u011345136
  • u011345136
  • 2014年03月03日 23:25
  • 818

poj 2352 Stars (树状数组)

我的第一道树状数组哇咔咔~~~~~~~~~ 大一
  • u012841845
  • u012841845
  • 2014年08月06日 11:50
  • 440
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 2352 Stars(简单树状数组)
举报原因:
原因补充:

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