POJ 2352 Stars
来源:互联网 发布:java特殊字符转义 编辑:程序博客网 时间:2024/06/05 14:36
题目链接 : POJ2352
Stars
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25657 Accepted: 11210
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<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<algorithm>#include<string>#include<vector>#include<map>#include<set>#include<queue>using namespace std;int le[15555],bit[32555];int query(int x){ int s=0; while(x>0) { s+=bit[x]; x-=x&-x; } return s;}int updat(int x){ while(x<32556) { bit[x]++; x+=x&-x; }}int main(){ int n,x,y; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d%d",&x,&y); le[query(x+1)]++; updat(x+1); } for(int i=0;i<n;i++) printf("%d\n",le[i]); return 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
- ubuntu下firefox安装flash
- C/C++的字符串和JAVA的String对象
- 『免费素材』15套提升设计的高质量纹理素材下载
- 米勒-拉宾素数测试
- apue习题10.5
- POJ 2352 Stars
- 关于今后的学习的思考
- hdu 4217
- UIIImageView 播放图片动画
- linux_取得路径文件名和目录名
- ssh使用的jar包介绍
- 透明化窗口SetLayeredWindowAttributes
- function object
- Win7系统中Telnet服务的安装和启动