HDU-2795 Billboard(线段树)
来源:互联网 发布:js li默认选中样式 编辑:程序博客网 时间:2024/06/04 23:24
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.
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.
3 5 524333
1213-1
要是不是看了胡浩前辈的博客,估计这题我又要暴力数组然后T了。。。。其实就是区间最值和单点更新的结合版本,把Query,Updata函数写到一起,不得不说真的很巧妙,然后就是刚刚敲完之后有一个样例过不了我就以为是自己线段树敲错了,结果调试了许久。。。发现主函数有个变量写错了。。。。>_<
代码:
#include#include#include #include using namespace std;#define lson l, m, rt<<1#define rson m+1, r, rt<<1|1const int N = 200000 + 5;int T[N<<2],h,w,n;void PushUP(int rt){ T[rt] = max(T[rt<<1], T[rt<<1|1]);}void Build(int l, int r, int rt){ T[rt] = w; if(l == r) return ; int m = (l + r) >> 1; Build(lson); Build(rson);}int Query(int wi, int l, int r, int rt){ if(l == r){ T[rt] -= wi; return l; } int m = (l + r) >> 1; int ret = (T[rt << 1] >=wi? Query(wi, lson):Query(wi, rson)); PushUP(rt); return ret;}int main(){ while(scanf("%d %d %d",&h,&w,&n)==3){ if(h > n) h = n; Build(1, h, 1); int wi; while(n--){ scanf("%d",&wi); if(wi > T[1]) puts("-1"); else printf("%d\n",Query(wi, 1, h, 1)); } } return 0;}
阅读全文
0 0
- HDU 2795 Billboard线段树
- HDU 2795 Billboard 线段树
- Billboard HDU 2795 线段树
- 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(线段树)
- 五种经典排序算法的实现(冒泡、归并、快排、堆排序、希尔)
- BZOJ 4059: [Cerc2012]Non-boring sequences 启发式合并
- two sum
- VUE axios 实现自定义下载功能
- 重写equlas,hashcode . 和比较类大小
- HDU-2795 Billboard(线段树)
- ASP.NET权限管理(二)
- studio快捷键(后面会在遇到的时候持续更新)
- Hello CSDN!
- linux shell 管道命令(pipe)使用及与shell重定向区别
- 设计模式
- 关于spring 启动类公共配置
- python datetime的加减操作
- HDU 6119 小小粉丝度度熊【尺取法】