【HDU】 2795 Billboard
来源:互联网 发布:电信机顶盒装软件 编辑:程序博客网 时间:2024/05/17 03:40
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16924 Accepted Submission(s): 7155
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
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>using namespace std;struct tree{ int l,r,k;};tree d[600005];int h,w,n,wi;void buildtree(int i,int l,int r,int w){ d[i].l=l; d[i].r=r; d[i].k=w; if (l==r) return; buildtree(i*2,l,(l+r)/2,w); buildtree(i*2+1,(l+r)/2+1,r,w);}int _insert(int i,int w){ int t; if (d[i].k<w) return -1; if (d[i].l==d[i].r) { d[i].k-=w; return d[i].l; } if (d[i*2].k>=w) t=_insert(i*2,w); else if (d[i*2+1].k>=w) t=_insert(i*2+1,w); d[i].k=max(d[i*2].k,d[i*2+1].k); return t;}int main(){ while (scanf("%d%d%d",&h,&w,&n)!=EOF) { buildtree(1,1,min(h,n),w); for (int i=1;i<=n;i++) { scanf("%d",&wi); printf("%d\n",_insert(1,wi)); } } 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
- 模拟 Codeforces620F Xors on Segments
- 单例
- tomcat 修改端口为80
- matlab画图,变长坐标轴
- MySQL多表连接删除问题相关
- 【HDU】 2795 Billboard
- AdSupport(简介)
- C++面试题(一)
- GitHub超详细图文攻略 - Git客户端下载安装 GitHub提交修改源码工作流程 Git分支 标签 过滤 Git版本工作流
- IOS后台常驻,实现后台下载
- javascript 之小白学习指南 专题 --作用域
- xcode崩溃时定位到出错行
- Ajax 笔记(十)
- 蓝桥算法训练之字母图形