POJ2352

原创 2015年07月08日 13:27:07
Stars
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 36355   Accepted: 15810

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.



簡單地讀一下題目意思就是紅色那段說的4和2的level是1,5的level是3,所以就是統計一下該點的左下角星星個數,然後輸出那個lvevl的星星數目。
#include<stdio.h>
#include<stdlib.h>
#define MAX 32005
int a[MAX]= {0},c[MAX]= {0};
int lowbit(int x)
{
    return x&(-x);
}
int sum(int i)
{
    int s;
    while(i>0)
    {
        s=s+c[i];
        i=i-lowbit(i);
    }
    return s;
}
void add(int x)
{
    while(x<=MAX)
    {
        ++c[x];
        x=x+lowbit(x);
    }
}
int main()
{
    int x,y,i,n;
    scanf("%d",&n);
    for(i=0; i<MAX; i++)
        a[i]=c[i]=0;
    for(i=0; i<n; i++)
    {
        scanf("%d%d",&x,&y);
        a[sum(++x)]++;
        add(x);
    }
    for(i=0; i<n; i++)
    {
        printf("%d\n",a[i]);
    }
    return 0;
}


POJ2352_Stars(线段树/单点更新)

解题报告 题意: 求在坐标系中
  • u013320038
  • u013320038
  • 2014年08月09日 19:15
  • 1603

treap||树状数组(poj2352)

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 34539   Accepte...
  • u010660276
  • u010660276
  • 2015年02月13日 18:15
  • 257

treap(poj2352)

 program poj2352; var w,r,l,d,s:array[0..30000] of longint; i,j,t,n:longint; x,y,ans:array...
  • jasonzhu8
  • jasonzhu8
  • 2010年07月13日 15:14
  • 1212

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

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

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

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

POJ 2352 Stars(treap)

题目大意: 给出n个y坐标递减的星星坐标,每个星星都有一个一个等级是这颗星星下边和右边的星星总数(水平垂直也算),求每个星星的等级。 题目思路: 用2叉树统计星星个数,treap优化,下边不用算:...
  • qq_35124363
  • qq_35124363
  • 2016年08月17日 13:23
  • 169

POJ2352(Treap || 线段树)

题目链接:http://poj.org/problem?id=2352 题目大意:先按Y的升序然后再按X的升序给出坐标,求出每个坐标左下方有多少个点,最后输出有从0到n-1个点的坐标有多少个。 本...
  • wenzhunpu
  • wenzhunpu
  • 2015年08月18日 07:43
  • 473

Poj2352

 Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 40161   Acc...
  • qq_33183401
  • qq_33183401
  • 2016年04月21日 22:03
  • 297

poj2352

线段树 #include #define maxn 45000 using namespace std; int cnt[maxn]={0},s[maxn]={0}; int n; int lo...
  • mdd18703649811
  • mdd18703649811
  • 2014年04月15日 19:35
  • 258

POJ2352

Stars Time Limit: 1000MS  Memory Limit: 65536K Total Submissions: 31671 Accepted: 13810 Descr...
  • Yuanchang_Best
  • Yuanchang_Best
  • 2014年07月26日 01:33
  • 266
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ2352
举报原因:
原因补充:

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