D. billboard

Source: Internet
Author: User
Tags integer numbers
D. billboard Time limit:8000 ms Case time limit:8000 ms Memory limit:32768kb 64-bit integer Io format: % I64dJava class name: Main 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 wowould always choose the topmost possible position for the announcement. Among all possible topmost positions she wowould 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 participant ants 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.
Inputthere 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. outputfor 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

Solution: Line Segment tree, line segment tree, line segment tree ........

 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cstdlib> 5 #include <vector> 6 #include <climits> 7 #include <algorithm> 8 #include <cmath> 9 #define LL long long10 using namespace std;11 const int maxn = 200010;12 struct node {13     int lt,rt,lmax,rmax;14 } tree[maxn<<2];15 int h,w,n,ans;16 void build(int lt,int rt,int v) {17     tree[v].lt = lt;18     tree[v].rt = rt;19     if(lt == rt) {20         tree[v].lmax = tree[v].rmax = w;21         return;22     }23     int mid = (lt+rt)>>1;24     build(lt,mid,v<<1);25     build(mid+1,rt,v<<1|1);26     tree[v].lmax = max(tree[v<<1].lmax,tree[v<<1].rmax);27     tree[v].rmax = max(tree[v<<1|1].lmax,tree[v<<1|1].rmax);28 }29 void add(int val,int v) {30     if(val > max(tree[v].lmax,tree[v].rmax)) {31         ans = -1;32         return;33     }34     if(tree[v].lt == tree[v].rt) {35         if(tree[v].lmax >= val) {36             ans = tree[v].lt;37             tree[v].lmax -= val;38             tree[v].rmax -= val;39         } else ans = -1;40         return;41     }42     if(val <= tree[v].lmax) add(val,v<<1);43      else add(val,v<<1|1);44     tree[v].lmax = max(tree[v<<1].lmax,tree[v<<1].rmax);45     tree[v].rmax = max(tree[v<<1|1].lmax,tree[v<<1|1].rmax);46 }47 int main() {48     int temp;49     while(~scanf("%d %d %d",&h,&w,&n)) {50         if(h > n) h = n;51         build(1,h,1);52         while(n--) {53             scanf("%d",&temp);54             ans = -1;55             add(temp,1);56             printf("%d\n",ans);57         }58     }59     return 0;60 }
View code


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.