hdu 2795 Billboard 变形线段树区间求最大值
来源:互联网 发布:vb spreadsheet控件 编辑:程序博客网 时间:2024/06/16 04:23
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15914 Accepted Submission(s): 6713
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
分析:巧妙地一道线段树区间求最大值问题,其实可以放海报的只是最后一层,其父节点只是判断作用,
//hdu 2795#include<cstdio>#include<algorithm>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn=222222;int h,w,n;int MAX[maxn<<2];void PushUP(int rt){ MAX[rt]=max(MAX[rt<<1],MAX[rt<<1|1]);}void build(int l,int r,int rt){ MAX[rt]=w; if(l==r)return; int m=(l+r)>>1; build(lson); build(rson);}int query(int x,int l,int r,int rt){ if(l==r){ MAX[rt]-=x; return l; } int m=(l+r)>>1; int ret=(MAX[rt<<1]>=x)?query(x,lson):query(x,rson); PushUP(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(MAX[1]<x)puts("-1"); else printf("%d\n",query(x,1,h,1)); } } return 0;}
0 0
- hdu 2795 Billboard 变形线段树区间求最大值
- HDU 2795 Billboard (线段树 单点更新 区间求最大值)
- hdu2795-Billboard (线段树求区间最大值)
- 线段树 单点更新查询 区间最大值 hdu 2795 Billboard
- HDU 2795 Billboard (线段树:区间查询最大值)
- HDU 2795 Billboard 线段树,区间最大值,单点更新
- hdu 2795 Billboard 转化 线段树 区间最大值
- HDOJ 2795 Billboard (线段树 + 单点更新,求区间最大值)
- hdu 2795(线段树:query:区间求最大值的位子)
- hdoj 2795 Billboard 【线段树 单点更新 + 维护区间最大值】
- Billboard(线段树区间最大值)
- 线段树求区间最大值
- 线段树区间求最大值
- 线段树求区间最大值
- HDU 2795 Billboard(线段树 区间最大)
- HDU 1754 I Hate It(线段树求区间最大值)
- hdu-1754 I Hate It【线段树求区间最大值】
- hdu2795——Billboard(线段树+区间最大值)
- 从 Linux 内核访问用户空间内存
- 1142 -- 同构词
- 使用Mac OS自带的apache
- [leetcode] 3.Longest Substring Without Repeating Characters
- TCP/IP、Http、Socket的区别
- hdu 2795 Billboard 变形线段树区间求最大值
- 1143 -- 函数解析式
- Hadoop第7周练习—MapReduce进行数据查询和实现推简单荐系统
- Linux下使用wget下载jdk
- 用java选择selenium下拉选择框的一个选项
- django中cache缓存技术的使用
- 我不是刘胸毛
- 正则表达式之 JS 验证
- SELinux入门教程