<span>HDU2795 Billboard（线段树基础题单节点更新区间查询）</span>

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
#define M 200005
#define ls node<<1,l,m
#define rs node<<1|1,m+1,r
int h,w,n,tree[M*4];
void buildtree(int node,int l,int r)
{
    tree[node]=w;
    if(l==r) return ;
    int m=(l+r)>>1;
    buildtree(ls);
    buildtree(rs);
}
int query(int node,int l,int r,int x)
{
    if(l==r)
    {
        tree[node]-=x;
        return l;
    }
    int m=(l+r)>>1;
    int p=(tree[node<<1]>=x)?query(ls,x):query(rs,x);
    tree[node]=max(tree[node<<1],tree[node<<1|1]);
    return p;
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(~scanf("%d%d%d",&h,&w,&n))
    {
        if(h>n) h=n;
        buildtree(1,1,h);
        int a;
        while(n--)
        {
            scanf("%d",&a);
            if(tree[1]<a) printf("-1\n");
            else printf("%d\n",query(1,1,h,a));
        }
    }
    return 0;
}