Billboard HDU - 2795

18人阅读 评论(0) 收藏 举报
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

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#define maxn 800010
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
 int h,w,n;
 /*一想这个线段树分成的左右区间代表什么(即l、r)代表h在l、r区间之间的最大宽度还有为多少......
 昨晚没看出来模型,今早晨想起来了一个图,算是理解了题意了吧,不过还是没有能够完整的写出来g
 没能完全相通线段树在这儿维护的是啥
 */
 int MAX[maxn];
void build_tree(int l,int r,int rt)
{
    MAX[rt]=w;
    if(l==r)
        return ;
        int m=(l+r)>>1;
    build_tree(lson);
    build_tree(rson);
}
void pushup(int rt)
{
    MAX[rt]=max(MAX[rt<<1],MAX[rt<<1|1]);
}
//做了几道题感觉到这些题的模板都是要找到线段树的叶子节点进行处理,然后在通过回溯进行向上维护
int query(int a,int l,int r,int rt)
{
    if(l==r)
    {
        MAX[rt]-=a;
        return l;//
    }
    int m=(l+r)>>1;
    int ans=(MAX[rt<<1]>=a)?query(a,lson):query(a,rson);//左子数代表的h是尽可能往上的
    pushup(rt);
    return ans;
}
int main()
{
   int a;
    while(cin>>h>>w>>n)//要是h>n的话,多出来的(h-n)层已经用不到了,加个特判
    {
        h=h>n?n:h;
        build_tree(1,h,1);
        for(int i=0;i<n;++i)
        {
            scanf("%d",&a);
             if(MAX[1]<a)//理解题意写成MAX[h]<a  就WA,咦,不对,MAX[1]正好代表的是线段树的根节点,当他的最大空间不足a时,肯定就就gg了
            {
                cout<<-1<<endl;
                continue;
            }
            cout<<query(a,1,h,1)<<endl;
        }
    }
    return 0;
}

自己题解题意做出来的图:



查看评论

HDU2795(Billboard)线段树

/************************************************* 题目大意: 有一块h*w的矩形广告板,要往上面贴广告; 然后给n个1*wi的广告,要求把广告贴上去...
  • Jarily
  • Jarily
  • 2013-03-02 21:24:02
  • 3754

hdu2795 Billboard(线段树)

Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) To...
  • d_x_d
  • d_x_d
  • 2015-12-12 21:27:08
  • 1598

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

Problem Description At the entrance to the university, there is a huge rectangular billboard of size...
  • libin56842
  • libin56842
  • 2013-10-23 20:08:22
  • 2159

杭电 HDU ACM 2795 Billboard(线段树伪装版)

Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...
  • lsgqjh
  • lsgqjh
  • 2015-07-24 23:50:51
  • 924

HDU2795_Billboard

Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...
  • u011676797
  • u011676797
  • 2014-08-07 16:09:28
  • 666

HDOJ 2795 Billboard (线段树 + 单点更新,求区间最大值)

Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...
  • my_sunshine26
  • my_sunshine26
  • 2017-04-04 19:45:36
  • 136

HDOJ 2795 - Billboard 线段树单点更新找区间最值

看到数据吓尿了...h,w都是10^9...线段树无从下手!..看了大牛的分析..大彻大悟..因为一个announcement最多占一行...而announcement的总数n     构图..每个叶...
  • kk303
  • kk303
  • 2013-07-20 19:02:24
  • 767

hdoj 2795 Billboard 【线段树 单点更新 + 维护区间最大值】

Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015-08-20 18:22:08
  • 1068

(2795)HDU

#include #include #include #include #include #include #include #define ll __int64 #defin...
  • wang57389675
  • wang57389675
  • 2015-04-08 16:35:42
  • 289

HDU 2795 BillBoard 线段树

题意:有一个
  • u012891242
  • u012891242
  • 2014-10-28 12:10:57
  • 484
    个人资料
    持之以恒
    等级:
    访问量: 5万+
    积分: 4000
    排名: 9744
    最新评论