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;
    }
  • 相关阅读:
    汤姆大叔 深入理解JavaScript系列(20):《你真懂JavaScript吗?》答案详解 后六道题答案
    canvas绘制自定义的曲线,以椭圆为例,通俗易懂,童叟无欺
    nodejs 平台的 webscoket 的实现
    javascript 控制台输出 图片 console.log 真强大 真佩服你们的创造力
    ichartjs 使用BUG,assign_scale:true 解决
    timequest静态时序分析学习笔记之工具使用
    timequest静态时序分析学习笔记之命令约束
    timequest静态时序分析学习笔记之基本概念
    浅谈“意识”的物质性
    构建异步处理网络服务器
  • 原文地址:https://www.cnblogs.com/skyleafcoder/p/12319551.html
Copyright © 2011-2022 走看看