POJ 2352 Stars
来源:互联网 发布:xp网络共享设置 编辑:程序博客网 时间:2024/06/05 14:17
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
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
树状数组的变形,因为输入很良心是按顺序输的也不用排序,一个一个加就可以了~
但是一定要注意,加的时候一定要循环到32001!不是n!
#include<cstdio>int n,x,y,a[32006],f[32006];int lowbit(int u){return u&(-u);}void add(int u){for(int j=u;j<=32001;j+=lowbit(j)) a[j]++;}int getnum(int u){int ans=0;for(int j=u;j;j-=lowbit(j)) ans+=a[j];return ans;}int main(){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d%d",&x,&y);add(x+1);f[getnum(x+1)-1]++;}for(int i=0;i<n;i++) printf("%d\n",f[i]);return 0;}
1 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
- POJ 2352 Stars
- poj 2352 Stars
- poj 2352 Stars
- spoj 1693 Coconuts( 违背自己意愿的票数与持不同意见的朋友对数的总和最小)
- Linux面试题汇总(含答案)
- 安卓状态栏优化,实现透明状态栏,沉侵式状态栏,改变状态栏颜色
- new/delete和malloc/free的区别一般汇总
- (一)80c52学习之旅-起始篇
- POJ 2352 Stars
- flume高并发优化——(10)消灭elasticsearch sink多次插入
- vs工程文件解决方法以及项目之间的关系
- win7 xml 图标恢复
- uboot 分析之 启动流程
- c++笔试面试3
- javascript上机题
- android中的反射应用场景分析(map转化为bean工具)
- 仿饿了么等APP底部菜单(Fragment实现)