HDU 2795 Billboard 线段树

原创 2015年11月17日 17:11:48

Billboard

Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16424    Accepted Submission(s): 6958


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.
 

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.
 

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 5 2 4 3 3 3
 

Sample Output
1 2 1 3 -1
 

Author
hhanger@zju
 

Source
 

Recommend
lcy   |   We have carefully selected several similar problems for you:  1698 1542 1828 1540 1255 
 

Statistic | Submit | Discuss | Note

o   题意:h*w的木板,放进一些1*L的物品,求每次放空间能容纳且最上边的位子
思路:每次找到最大值的位子,然后减去L
线段树功能:query:区间求最大值的位子(直接把update的操作在query里做了)

ACcode:
#pragma warning(disable:4786)//使命名长度不受限制
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define rds(x) scanf("%s",x)
#define rdc(x) scanf("%c",&x)
#define ll long long int
#define maxn  222222
#define mod 1000000007
#define INF 0x3f3f3f3f //int 最大值
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define MT(x,i) memset(x,i,sizeof(x))
#define PI  acos(-1.0)
#define E  exp(1)
using namespace std;
int tree[maxn<<2],h,n,w,x;
void creatTree(int st,int left,int right){
    tree[st]=w;
    if(left==right)return;
    int m=(left+right)>>1;
    int temp=st<<1;
    creatTree(temp,left,m);
    creatTree(temp+1,m+1,right);
}
int qurey(int st,int data,int left,int right){
    if(left==right){
        tree[st]-=data;
        return left;
    }
    int m=(left+right)>>1;
    int temp=st<<1;
    int res(0);
    res=tree[temp]>=x?qurey(temp,data,left,m):qurey(temp+1,data,m+1,right);
    tree[st]=max(tree[temp],tree[temp+1]);
    return res;
}
int main(){
    while(cin>>h>>w>>n){
        if(h>n)h=n;
        creatTree(1,1,h);
        while(n--){
            rd(x);
            if(tree[1]<x)printf("-1\n");
            else printf("%d\n",qurey(1,x,1,h));
        }
    }
    return 0;
}
/*
3 5 5
2
4
3
3
3
*/


版权声明:本文为博主原创文章,未经博主允许不得转载。

【线段树求最靠前】【HDU2795】【Billboard】

题意: 有一个H*W的广告牌,当插入一个广告时(1*Wi),问最靠前的插入方式是什么 新生赛有个类似的题目,可惜当时居然没水过去。 果断用线段树做 以H为线段 建树,存[l,r]中最大的...

HDU2795 Billboard(线段树单点更新,区间最大值)

题目: Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Oth...

hdu 2795 Billboard(线段树单点更新)

Billboard                                                Time Limit: 20000/8000 MS (Java/Others)   ...

hdu 2795 Billboard(线段树)

Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total ...

HDU2795:Billboard(线段树单点更新)

Problem Description At the entrance to the university, there is a huge rectangular billboard of size...

HDU-2795 Billboard (线段树)RE的教训!

题目连接 搞了两天的线段树,我一直在犯一个错误,代码看似没错提交总是RE!,心中的迷惑不解,连续做了几道题,都这样,我彻底无语了,搞的我没心情去涮题了。 这题也不列外,提交总是RE,感觉自己数组开...

HDU 2795 Billboard (线段树 单点更新, 询问位置)

题目大意: 就是h*w的板, 每次向上面空白位置贴1*w的条(不能旋转) 问每次贴能找到的最上面的位置 大致思路: 线段树练习题, 刷刷刷 代码如下: Result  : ...

HDU 2795 Billboard //线段树简单应用

Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...

【解题报告】 HDU 2795 Billboard -- 线段树的应用

题目大意:有一个广告板,告诉我们尺寸(即高度宽度),我们要贴广告,广告的尺寸规定为1*w,我们每次从最左上面开始贴,当给出的广告不够贴时,移到下一行贴。输出当前广告贴在第几行。 题目连接:->  H...

HDU 2795 Billboard 线段树 顺序点更新

原题: http://acm.hdu.edu.cn/showproblem.php?pid=2795题目大意: 有规格为h*w的广告牌,有n个高度为1的广告牌,优先从高处放,从左边放,求每个广告牌...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 2795 Billboard 线段树
举报原因:
原因补充:

(最多只允许输入30个字)