hdu-2795-Billboard(线段树)

水深无声 2022-06-12 14:16 202阅读 0赞

## Billboard ##

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

题意：

有个公告板，大小为h\*w,要贴n张公告，每个公告的长度是k，高度固定为1，公告放的要尽可能靠上并尽可能靠左，每给出一张公告，要求这个公告在满足要求的情况下放在了第几层。

思路：

因为每个公告的高度一定，可以以公告牌的高度来建树，树从左到右代表了公告牌从上到下，输入公告的长度后，先和w比，如果大于w则直接输出-1.

如果k<w，则进入insert1函数，因为公告先贴到上边，所以优先考虑左子树，每贴一条公告后，就有一个子树剩余的空间就会减少，所以 贴完后要对树进行更新

代码：

C++ Code

<table style="width:100%; font-family:'Consolas','Courier New'; font-size:12px; vertical-align:text-top; line-height:15px"> 
 <tbody> 
 <tr> 
 <td style="color:#008284; background-color:#e3e3e3; vertical-align:text-top"> 
 <div style="margin:7px; text-align:right; white-space:nowrap">
 1 
 2 
 3 
 4 
 5 
 6 
 7 
 8 
 9 
 10 
 11 
 12 
 13 
 14 
 15 
 16 
 17 
 18 
 19 
 20 
 21 
 22 
 23 
 24 
 25 
 26 
 27 
 28 
 29 
 30 
 31 
 32 
 33 
 34 
 35 
 36 
 37 
 38 
 39 
 40 
 41 
 42 
 43 
 44 
 45 
 46 
 47 
 48 
 49 
 50 
 51 
 52 
 53 
 54 
 55 
 56 
 57 
 58 
 59 
 60 
 61 
 62 
 63 
 64 
 65 
 66 
 67 
 
 </div> </td> 
 <td style="background-color:#008284; padding:1px"> 
 <div style="border:1px #008284 solid"></div> </td> 
 <td style="width:100%; vertical-align:text-top; background-color:rgb(239,239,239)"> 
 <div style="margin:7px"> 
 #include&nbsp;&lt;stdio.h&gt; 
 
 #include&nbsp;&lt;string.h&gt; 
 
 #include&nbsp;&lt;algorithm&gt; 
 
 using&nbsp; 
 namespace&nbsp;std; 
 
 
 int&nbsp;h,w,n; 
 
 int&nbsp;ans; 
 
 
 struct&nbsp;node 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;l,r,n; 
 ///左端点，右端点，以及剩余的空白长度， }&nbsp;a[ 
 1000000]; 
 
 
 void&nbsp;init( 
 int&nbsp;l, 
 int&nbsp;r, 
 int&nbsp;i, 
 int&nbsp;w) 
 ///建树&nbsp;（左端点，右端点，结构体编号，长度） { 
 &nbsp;&nbsp;&nbsp;&nbsp;a[i].l=l; 
 &nbsp;&nbsp;&nbsp;&nbsp;a[i].r=r; 
 &nbsp;&nbsp;&nbsp;&nbsp;a[i].n=w; 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 if(l!=r) 
 &nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 ///二分法建树 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;mid=(l+r)/ 
 2; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;init(l,mid, 
 2*i,w); 
 ///建左树， &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;init(mid+ 
 1,r, 
 2*i+ 
 1,w); 
 ///建右树 &nbsp;&nbsp;&nbsp;&nbsp;} 
 } 
 
 
 void&nbsp;insert( 
 int&nbsp;i, 
 int&nbsp;x) 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 if(a[i].l&nbsp;==&nbsp;a[i].r)&nbsp;&nbsp;&nbsp;&nbsp; 
 ///左端点等于右端点，&nbsp;到了叶子节点，叶子节点的值既是层数 &nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a[i].n-=x;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 ///该层宽度减少 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ans&nbsp;=&nbsp;a[i].l; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp;; 
 &nbsp;&nbsp;&nbsp;&nbsp;} 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 if(x&lt;=a[ 
 2*i].n)&nbsp;&nbsp;&nbsp; 
 ///左子树的宽度可以放下，符合要求搜左子树 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;insert( 
 2*i,x); 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 else&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 ///否则右子树 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;insert( 
 2*i+ 
 1,x); 
 &nbsp;&nbsp;&nbsp;&nbsp;a[i].n&nbsp;=&nbsp;max(a[ 
 2*i].n,a[ 
 2*i+ 
 1].n);&nbsp;&nbsp; 
 ///将左右子树里能放的最大长度存入父亲节点，进行更新 } 
 
 
 int&nbsp;main() 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;i,k; 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 while(scanf( 
 "%d%d%d",&amp;h,&amp;w,&amp;n)!=EOF) 
 &nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 if(h&gt;n) 
 ///根据题意，因为最多放n个公告，占用的最大高度也只有n &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;h&nbsp;=&nbsp;n; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;init( 
 1,h, 
 1,w); 
 ///从第一行，间高度为h的树，根节点编号为1，初始化广告板的长度为w; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ans&nbsp;=&nbsp;- 
 1; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 for(i&nbsp;=&nbsp; 
 1;&nbsp;i&lt;=n;&nbsp;i++) 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;scanf( 
 "%d",&amp;k); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 if(a[ 
 1].n&gt;=k)&nbsp;&nbsp;&nbsp;&nbsp; 
 ///如果这个公告没有超出公告板的长度，那么才能放入 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;insert( 
 1,k); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;printf( 
 "%d\n",ans); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 else 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;printf( 
 "-1\n"); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} 
 &nbsp;&nbsp;&nbsp;&nbsp;} 
 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp; 
 0; 
 } 
 
 </div> </td> 
 </tr> 
 </tbody> 
</table>