POJ - 2352 Stars 树状数组做法
来源:互联网 发布:s7-200中断编程 编辑:程序博客网 时间:2024/04/28 08:30
Stars
Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u
[Submit] [Go Back] [Status]
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.
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
51 15 17 13 35 5
Sample Output
12110
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
Source
Ural Collegiate Programming Contest 1999
树状数组的简单题,如果熟悉线段树的话,应该很容易理解这个题。代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
const int maxm=32000+5;
int n;
int c[maxm],level[maxm];
int lowbit(int x)
{
return x&(-x);
}
int sum(int n)
{
int s=0;
while(n>0)
{
s+=c[n];
n-=lowbit(n);
}
return s;
}
void add(int x)
{
while(x<=maxm)
{
++c[x];
x+=lowbit(x);
}
}
int main()
{
int x,y,i,n;
while(scanf("%d",&n)!=EOF)
{
memset(level, 0, sizeof(level));
memset(c, 0, sizeof(c));
for(i=0;i<n;++i)
{
scanf("%d%d",&x,&y);
++x;
level[sum(x)]++;
add(x);
}
for(i=0;i<n;++i)
printf("%d\n",level[i]);
}
}
#include<cstdio>
#include<cstring>
#include<string>
const int maxm=32000+5;
int n;
int c[maxm],level[maxm];
int lowbit(int x)
{
return x&(-x);
}
int sum(int n)
{
int s=0;
while(n>0)
{
s+=c[n];
n-=lowbit(n);
}
return s;
}
void add(int x)
{
while(x<=maxm)
{
++c[x];
x+=lowbit(x);
}
}
int main()
{
int x,y,i,n;
while(scanf("%d",&n)!=EOF)
{
memset(level, 0, sizeof(level));
memset(c, 0, sizeof(c));
for(i=0;i<n;++i)
{
scanf("%d%d",&x,&y);
++x;
level[sum(x)]++;
add(x);
}
for(i=0;i<n;++i)
printf("%d\n",level[i]);
}
}
0 0
- POJ - 2352 Stars 树状数组做法
- POJ 2352 Stars 树状数组
- POJ 2352 Stars【树状数组】
- (树状数组) poj 2352 Stars
- POJ-2352-Stars-树状数组
- POJ 2352 Stars 树状数组
- POJ 2352 Stars 【树状数组】
- POJ 2352 Stars 树状数组
- POJ-2352 Stars【树状数组】
- POJ 2352 Stars 树状数组
- poj 2352 Stars 树状数组
- poj 2352 Stars 树状数组
- POJ:2352 Stars(树状数组)
- [树状数组]POJ 2352 Stars
- POJ-2352-Stars 树状数组
- Stars - POJ 2352 树状数组
- poj 2352 Stars 树状数组
- poj 2352 Stars (树状数组)
- CABasicAnimation用法
- android屏幕的适配
- iOS培训学费多少
- 取得分组 TOP-N
- Zz: CS硕士菜鸟美帝求职经验
- POJ - 2352 Stars 树状数组做法
- Sublime Text 2快捷键大全
- 在Bean中获取Spring容器中的各种组件
- javascript高级编程
- Border
- hdu-1028-Ignatius and the Princess III
- 通用事件处理过程
- IO端口和IO内存的区别及分别使用的函数接口
- 一个网站的诞生04--抓取一个餐厅的某个月的全部评论