HDU-2795-Billboard
来源:互联网 发布:淘宝白菜价在哪里 编辑:程序博客网 时间:2024/06/05 05:39
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24261 Accepted Submission(s): 9990
Total Submission(s): 24261 Accepted Submission(s): 9990
Problem Description
At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming competitions, changes in the dining room menu, and other important information.
On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.
Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.
When someone puts a new announcement on the billboard, she would always choose the topmost possible position for the announcement. Among all possible topmost positions she would always choose the leftmost one.
If there is no valid location for a new announcement, it is not put on the billboard (that's why some programming contests have no participants from this university).
Given the sizes of the billboard and the announcements, your task is to find the numbers of rows in which the announcements are placed.
On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.
Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.
When someone puts a new announcement on the billboard, she would always choose the topmost possible position for the announcement. Among all possible topmost positions she would always choose the leftmost one.
If there is no valid location for a new announcement, it is not put on the billboard (that's why some programming contests have no participants from this university).
Given the sizes of the billboard and the announcements, your task is to find the numbers of rows in which the announcements are placed.
Input
There are multiple cases (no more than 40 cases).
The first line of the input file contains three integer numbers, h, w, and n (1 <= h,w <= 10^9; 1 <= n <= 200,000) - the dimensions of the billboard and the number of announcements.
Each of the next n lines contains an integer number wi (1 <= wi <= 10^9) - the width of i-th announcement.
The first line of the input file contains three integer numbers, h, w, and n (1 <= h,w <= 10^9; 1 <= n <= 200,000) - the dimensions of the billboard and the number of announcements.
Each of the next n lines contains an integer number wi (1 <= wi <= 10^9) - the width of i-th announcement.
Output
For each announcement (in the order they are given in the input file) output one number - the number of the row in which this announcement is placed. Rows are numbered from 1 to h, starting with the top row. If an announcement can't be put on the billboard, output "-1" for this announcement.
Sample Input
3 5 524333
Sample Output
1213-1
Author
hhanger@zju
Source
HDOJ 2009 Summer Exercise(5)
这道题可以把高度与宽度翻转一下,以高度做一个线段树。建立线段树之后,每次向左子树寻找最大值比海报宽度大的点,插入海报,并输出端点号。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=2e6;int num[maxn];int n,a,b;struct node{int sum,l,r;}d[maxn*3];void Build(int o,int l,int r)//建树 {d[o].l=l;d[o].r=r;d[o].sum=b;if(l==r){return ;}int mid=(l+r)/2;Build(o*2,l,mid);Build(o*2+1,mid+1,r);}int Mop(int x,int y)//x是输入的数,y是第几个数,从1开始。 {if(d[y].l==d[y].r){ d[y].sum-=x;return d[y].l;}else{int sum1=0,sum2=0;if(x<=d[y*2].sum){sum1=Mop(x,y*2);}else if(x<=d[y*2+1].sum){sum2=Mop(x,y*2+1);}d[y].sum=max(d[y*2].sum,d[y*2+1].sum);return sum1+sum2;}}int main(){while(scanf("%d %d %d",&a,&b,&n)!=EOF){if(a>n){//只要长度不多于所给的广告数量就行。 a=n;}Build(1,1,a);int k;for(int i=1;i<=n;i++){scanf("%d",&k);if(k<=d[1].sum){printf("%d\n",Mop(k,1));}else{printf("-1\n");}}}return 0;}
阅读全文
0 0
- hdu 2795 Billboard
- hdu 2795 Billboard
- hdu 2795 Billboard
- hdu 2795 Billboard
- hdu 2795 Billboard
- hdu 2795 Billboard
- HDU 2795 - Billboard
- hdu 2795 Billboard
- HDU-2795-Billboard
- HDU 2795 Billboard
- hdu 2795 Billboard
- HDU 2795 Billboard
- hdu 2795 Billboard
- Hdu 2795 Billboard
- Hdu 2795 Billboard
- hdu 2795 Billboard
- hdu 2795 Billboard
- hdu 2795 Billboard
- 人脸识别之人眼定位、人脸矫正、人脸尺寸标准化---<Mastering OpenCV with Practical Computer Vision Projects >
- codeforces 810B
- [CentOS]安装软件:/lib/ld-linux.so.2: bad ELF interpreter 解决
- strtok函数的应用
- VS2010+PCL1.6.0环境配置
- HDU-2795-Billboard
- 八数码难题codevs1225
- spring创建bean
- 图结构练习——BFS——从起始点到目标点的最短步数
- (字典树)Phone List--HDOJ
- Tray 轻量级数据存储 sharepreference的替代实现方案
- Audio mix algorithm
- select函数实例代码
- 滑动窗口变形题-最大值减去最小值小于等于num的子数组