hdu 2795 Billboard 线段树
2018-03-19 20:25
399 查看
[align=center] 阿里2018实习生校招直播!看直播,投简历.... [/align] |
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25998 Accepted Submission(s): 10643 [align=left]Problem Description[/align]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. [align=left]Input[/align]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. [align=left]Output[/align]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. [align=left]Sample Input[/align]3 5 5 2 4 3 3 3 [align=left]Sample Output[/align]1 2 1 3 -1 |
然后给n个1*wi的广告,要求把广告贴上去;
而且要求广告要尽量往上贴并且尽量靠左;
求第n个广告的所在的位置,不能贴则为-1;
解题思路:利用线段树可以得出区间的最大值,在结构体中定义一个Max变量,用来表示这段区间内有最多空位的那一行的空位长度。与输入进来的长度进行比较,先左边比较,再右边。(也就是左子树的最大值大于他,就查询左子树,否则查询右子树)。
#include <iostream> #include <cstdio> #include <cstring> using namespace std; struct node { int l,r; int Max;//这段区间内有最多空位的那一行的空位长度 } s[200000*4]; void InitTree(int l,int r,int k,int w) { s[k].l=l; s[k].r=r; s[k].Max=w; if (l==r) return ; int mid=(l+r)/2; InitTree(l,mid,2*k,w); InitTree(mid+1,r,2*k+1,w); } void UpdataTree(int ww,int k) { if (s[k].l==s[k].r) { printf ("%d\n",s[k].l); s[k].Max-=ww; return ; } if (ww<=s[k*2].Max) UpdataTree(ww,k*2); else UpdataTree(ww,k*2+1); s[k].Max=s[k*2].Max>s[k*2+1].Max?s[k*2].Max:s[k*2+1].Max; } int main() { int h,w,n; int ww; while (~scanf("%d%d%d",&h,&w,&n)) { if (h>n)//h<=n,大了就没有意义了 h=n; InitTree(1,h,1,w); for (int i=1; i<=n; i++) { scanf("%d",&ww); if (s[1].Max>=ww) UpdataTree(ww,1); else printf ("-1\n"); } } return 0; }
相关文章推荐
- 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 (线段树)
- hdu2795 Billboard 线段树区间更新
- HDU 2795 Billboard(线段树,单点查询)
- HDU 2795 Billboard (线段树 单点更新 区间求最大值)
- hdu-2795-Billboard(线段树)
- hdu 2795 Billboard(线段树)
- hdu 2795 Billboard线段树运用(单点更新)