HDOJ2795 线段树查询区间最大值
来源:互联网 发布:博客网站源码下载 编辑:程序博客网 时间:2024/06/15 10:51
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24704 Accepted Submission(s): 10143
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)
Recommend
lcy | We have carefully selected several similar problems for you: 1542 1394 1828 1540 1255
比较easy的线段树查询区间最值运用,注意的是h不应该超过n。
#include <iostream>#include <cstdio>#include <cmath>using namespace std;const int maxn = 8e5 + 20;int a[maxn];int i,j,k;int h,w,n;void build(int left, int right, int root){ a[root] = w; if (left == right) return; int mid =(left+right)>>1; build(left,mid,root<<1); build(mid+1,right,(root<<1)+1);}int query(int left, int right, int root, int num){ if (left==right) { a[root] -= num; return left; } int mid = (left+right)>>1; int res = (a[root<<1]>=num)?query(left,mid,root<<1,num):query(mid+1,right,(root<<1)+1,num); a[root] = max(a[root<<1],a[(root<<1)+1]); return res;}int main(){ while (scanf("%d %d %d",&h,&w,&n)!=EOF){ if (h>n) h = n; build(1,h,1); while (n--) { scanf("%d",&k); if (a[1]<k) printf("-1\n"); else printf("%d\n",query(1,h,1,k)); } } return 0;}
阅读全文
0 0
- HDOJ2795 线段树查询区间最大值
- HDOJ2795 Billboard(线段树)
- 线段树 单点更新查询 区间最大值 hdu 2795 Billboard
- HDU 2795 Billboard (线段树:区间查询最大值)
- 线段树区间最大值查询,单点更新,建立模板
- 线段树--数据结构(建树,查询区间和&&最大值&&最小值)
- 动态区间最大值最小值区间和查询,支持区间设置,线段树
- 线段树求区间最大值
- 线段树区间求最大值
- 线段树区间和最大值
- 线段树求区间最大值
- 线段树(区间和,最大值,最小值,区间动态更新查询)
- vijos 1659 河蟹王国 线段树区间加、区间查询最大值
- 线段树区间查询
- 线段树学习笔记(单点更新+区间查询最大值+lazy标记+pushdown操作+区间更新+求区间和)
- 区间更新 区间和查询 带有延迟标记 线段树 hdu1698; 附:csa 区间加值,维护最大值
- hdu1754-线段树(求区间最大值)
- hdu1754 初探线段树之区间最大值、
- Hadoop 2.6 集群搭建从零开始之4 Hadoop的安装与配置(完全分布式环境)
- 217/219. Contains Duplicate /Contains Duplicate II
- 简单粗暴——Spring boot测试类编写
- MongoDB安装与配置(windows)
- JAVA 内存泄漏详解
- HDOJ2795 线段树查询区间最大值
- spring入门笔记(一)IOC和bean的配置项
- C++之对象的动态建立和释放
- unity3d 贴图优化,借用ps脚本pot批处理
- JavaScript基础
- 深入学习RabbitMQ:channel的confirm模式
- Unity 使用数据库(MySql)
- WinForm窗体及其控件的自适应
- 高效程序员_(1)_软件_让鼠标飞,WGestures全局鼠标手势