HDU 2795——Billboard(线段树)
来源:互联网 发布:视频解码软件 编辑:程序博客网 时间:2024/06/05 16:28
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11208 Accepted Submission(s): 4955
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
题目大意:
有一块h*w的宣传栏,有n张得海报,每张海报高度为1,贴海报的要求是尽量高,同样高的话尽量靠左。输出每张海报的高度位置,位置编号从顶自下1到h
思路:
用叶子节点来表示高度,每个节点保存每段区间剩余长度,初始为w。查询的话,优先往左,左的不行再往右
自己还是太水!
#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn=200001;using namespace std;int h,w,n;int len[maxn<<2];void push_up(int rt){ len[rt]=max(len[rt<<1],len[rt<<1|1]);}void build(int l,int r,int rt){ if(l==r){ len[rt]=w; return ; } int m=(l+r)>>1; build(lson); build(rson); push_up(rt);}int query(int v,int l,int r,int rt){ if(l==r){ len[rt]-=v; return l; } int m=(l+r)>>1; int ret=(len[rt<<1] >=v) ? query(v,lson):query(v,rson); push_up(rt); return ret;}int main(){ while(scanf("%d %d %d",&h,&w,&n)!=EOF){ if(h>n) h=n; build(1,h,1); while(n--){ int x; scanf("%d",&x); if(len[1]<x) printf("-1\n"); else printf("%d\n",query(x,1,h,1)); } } return 0;}
0 0
- HDU 2795——Billboard(线段树)
- hdu 2795 Billboard(线段树)
- hdu - 2795 - Billboard(线段树)
- hdu 2795 Billboard(线段树)
- [ACM] 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 (线段树)
- MFC之多线程学习
- 中断处理程序&中断服务例程
- Jedis访问redis集群以及crc16
- Excel列获取
- Android发送接收短信的代码示例(本人验证OK)
- HDU 2795——Billboard(线段树)
- python链接oracle数据库
- 多线程互斥与同步
- 可怕的中国人逻辑缺陷,你了解多少?
- 【算法导论学习-28】Fibonacci数列及其相关
- C语言可变参数的实现机制
- Firefox中文件下载JS
- eclipse 各个版本的比较
- 【DP】UVA 10651 Pebble Solitaire 记忆化搜索