HDOJ 2795 Billboard

#include <cstdio>
#include <limits.h>
#define max(a,b) ((a) > (b) ? (a) : (b))
#define min(a,b) ((a) < (b) ? (a) : (b))
using namespace std;
const int maxn = 200000+10;
int crt[maxn<<2];
void build_tree(int o, int l, int r,int x){
    int lc = o * 2, rc = o * 2 + 1;
    crt[o] = x;
    if(l == r)return ;
    build_tree(lc,l,(l+r)/2,x);
    build_tree(rc,(l+r)/2+1,r,x);
}
int query(int o, int l, int r, int x){
    int ret;
    int lc = o * 2, rc = o * 2 + 1;
    if( l == r ){
        crt[o] -= x;
        return r;
    }
    else {
        if( x <= crt[lc] )
        ret = query( lc, l, (l+r)/2, x);
        else
        ret = query(rc, (l+r)/2+1, r, x);
    }
    crt[o] = max( crt[lc], crt[rc] );
    return ret;
}
int main(){
    int h,w,n;
    int x;
    while(~scanf("%d%d%d",&h,&w,&n)){
        int cnt = min(h, n);                      //要取最小值
        build_tree(1, 1, cnt, w);                  //注意是cnt
        for(int i = 0; i < n; ++i ) {
            scanf("%d",&x);
            if(x>crt[1])printf("-1\n");
            else printf("%d\n",query(1,1,cnt,x));   //这里是cnt
        }
    }
    return 0;
}