zoukankan      html  css  js  c++  java
  • 线段树(维护最大值):HDU Billboard

    Billboard

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


    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
     
      这题不断维护最大值就可以了。
     1 #include <iostream>
     2 #include <cstring>
     3 #include <cstdio>
     4 using namespace std;
     5 const int maxn=200010;
     6 int t[maxn<<2];
     7 int h,w,n,x;
     8 
     9 void Build(int node,int l,int r)
    10 {
    11     t[node]=w;
    12     if(l==r)return;
    13     int mid=(l+r)>>1;
    14     Build(node<<1,l,mid);
    15     Build(node<<1|1,mid+1,r);
    16 }
    17 
    18 void Query(int node,int l,int r,int q)
    19 {
    20     if(l==r){
    21         printf("%d
    ",l);
    22         t[node]-=q;
    23         return;
    24     }
    25     int mid=(l+r)>>1,a=node<<1,b=a+1;
    26     if(t[a]>=q)Query(a,l,mid,q);
    27     else Query(b,mid+1,r,q);
    28     t[node]=max(t[a],t[b]);
    29     return;    
    30 }
    31 int main()
    32 {
    33     while(~scanf("%d%d%d",&h,&w,&n)){    
    34         h=min(n,h);    
    35         Build(1,1,h);
    36         for(int i=1;i<=n;i++){
    37             scanf("%d",&x);
    38             if(x>t[1])
    39                 printf("-1
    ");
    40             else    
    41                 Query(1,1,h,x);
    42         }
    43     }
    44     return 0;    
    45 }
    尽最大的努力,做最好的自己!
  • 相关阅读:
    php---观察者模式
    elasticsearch常用查询和注意点
    linux镜像iso格式
    Mysql查询今天、昨天、7天、近30天、本月、上一月数据
    php常用算法
    算法之斐波纳契数列递归和迭代实现
    带你了解session和cookie作用原理区别和用法
    mysql大数据量的分页优化
    常用链接
    自然语言处理
  • 原文地址:https://www.cnblogs.com/TenderRun/p/5272951.html
Copyright © 2011-2022 走看看