zoukankan      html  css  js  c++  java
  • 线段树——G

    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

    建树有点不一样,每行看成一个点。区间最大值全部设为w,因为广告只会落到每一行。

    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    #define N 1000000
    int h,w,n;
    int ans;
    struct node//结构体建树
    {
        int l,r,n;
    } a[N];
    void build(int l,int r,int i,int w)
    {
        a[i].l=l;
        a[i].r=r;
        a[i].n=w;
        if(l!=r)
        {
            int mid=(l+r)/2;
            build(l,mid,2*i,w);
            build(mid+1,r,2*i+1,w);
        }
    }
    void update(int i,int x)
    {
        if(a[i].l==a[i].r)//到了最子节点才更新
        {
            a[i].n-=x;
            ans = a[i].l;
            return ;
        }
        if(x<=a[2*i].n)//先左后右
            update(2*i,x);
        else
            update(2*i+1,x);
        a[i].n=max(a[2*i].n,a[2*i+1].n);
    }
    
    int main()
    {
        int i,k;
        while(~scanf("%d%d%d",&h,&w,&n)){
        if(h>n)
        h=n;
        build(1,h,1,w);
        ans=-1;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&k);
            if(a[1].n>=k)
            update(1,k);
            printf("%d
    ",ans);
            ans=-1;
        }
        }
        return 0;
    }
  • 相关阅读:
    sourcetree提交代码到远程仓库的方法
    使用sourcetree管理拉取代码的方法
    运用在伪类content上的html特殊字符
    H5在ios弹窗状态下调起输入法后关闭输入法页面元素错位解决办法
    Sticky footer经典布局--绝对底部布局
    Vue微信自定义分享时安卓系统config:ok,ios系统config:invalid signature签名错误,或者安卓和ios二次分享时均config:ok但是分享无效的解决办法
    如何在开发时用PC端对移动端页面进行调试
    SVN使用教程总结
    Keywords Search HDU2222 AC自动机模板题
    POJ
  • 原文地址:https://www.cnblogs.com/skyleafcoder/p/12319551.html
Copyright © 2011-2022 走看看