hdu 2795 billboard(线段树)
来源:互联网 发布:2016全国溺水事故数据 编辑:程序博客网 时间:2024/06/05 02:27
题目:点击打开链接
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22545 Accepted Submission(s): 9380
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<stdio.h>#include<string.h>#define N 200010struct{ int l,r,left;}tree[4*N];int min(int a,int b){ if(a<=b) return a; else return b;}int max(int a,int b){ if(a>=b) return a; else return b;}void build(int t,int l,int r,int w){ tree[t].l=l; tree[t].r=r; tree[t].left=w; if(l==r) return; int mid=(l+r)/2; build(2*t,l,mid,w); build(2*t+1,mid+1,r,w);}int update(int t,int x){ if(tree[t].l==tree[t].r){ tree[t].left-=x; return tree[t].l; } int ans=0; if(tree[2*t].left>=x) ans=update(2*t,x); else ans=update(2*t+1,x); tree[t].left=max(tree[2*t].left,tree[2*t+1].left); return ans;}main(){ int h,w,n,a,board; while(scanf("%d%d%d",&h,&w,&n)==3){ build(1,1,min(h,n),w); while(n--){ scanf("%d",&board); if(tree[1].left<board) printf("-1\n"); else printf("%d\n",update(1,board)); } }}
阅读全文
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(线段树)
- 快速排序
- Eclipse连接mysql数据库
- hdu2670
- Thymeleaf 之 内置对象、定义变量、URL参数及标签自定义属性
- 四大组件之Activity
- hdu 2795 billboard(线段树)
- ural1108Heritage
- javaSE_8系列博客——Java语言的特性(五)--接口和继承(2)--定义接口
- java文件读写操作
- 递推的矩阵乘法解决练习1
- 使用Struts2关于页面信息国际化(简单的)
- linux centos下安装pymysql
- 概率论中伯努利分布(bernoulli distribution)介绍及C++11中std::bernoulli_distribution的使用
- <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content