POJ
来源:互联网 发布:把别人淘宝制成csv 编辑:程序博客网 时间:2024/06/06 04:41
Stars
POJ - 2352Astronomers 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.
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.
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.
51 15 17 13 35 5
12110
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
思路:因为x<=32000,可以用线段树做。每个节点记录一段区间内的星星数,每次插入一个星星,就可以找出x比它小的星星数,同时又因为是按y递增的顺序输入的,所以之前的星星的y坐标一定小于等于当前插入的星星的y坐标。
#include<iostream>#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;const int MAX=32000+10;struct lenka{int l,r,sum;}a[MAX<<2];int n,ans,QWQ[MAX];void build(int k,int l,int r){a[k].l=l,a[k].r=r;a[k].sum=0;if(l==r)return;build(2*k,l,(l+r)/2);build(2*k+1,(l+r)/2+1,r);}void insert(int k,int x){if(x==a[k].l&&x==a[k].r){ans+=a[k].sum;a[k].sum++;return;} //x坐标相同的也要加上if(x>=a[2*k+1].l)ans+=a[2*k].sum,insert(2*k+1,x); //左子树的星星x坐标都小于等于xelse insert(2*k,x);a[k].sum=a[2*k].sum+a[2*k+1].sum;}int main(){while(scanf("%d",&n)!=EOF){build(1,0,32000);memset(QWQ,0,sizeof QWQ);for(int i=0;i<n;i++){int x,y;scanf("%d%d",&x,&y);ans=0;insert(1,x); //插入QWQ[ans]++;}for(int i=0;i<n;i++)printf("%d\n",QWQ[i]);}return 0;}
阅读全文
1 0
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- 例2-23 用一个随机序列模拟中国数字地震台网记录在频率域的振幅。中国数字地震台网的采样间隔是0.02s,运用通带频率是0-5Hz的低通理想滤波器对其进行滤波。数据长度是120s。模拟一下。
- 欢迎使用CSDN-markdown编辑器
- 使用VS2010创建windows窗体应用程序
- JAVA中关于new子类对象时是否创建父类
- JAVA数据结构笔记
- POJ
- 解决:firefox安装firebug版本不兼容
- 使用Python作为计算器
- Django中的Manager类
- 把matlab双坐标轴的颜色设置为黑色
- 怎样提高https站点的访问速度
- 【C++】类和结构
- [Leetcode] 113, 53, 124
- 解决git以 https和ssh方式 每次都要输入用户名和密码问题