2795 Billboard
题解
- 叶子结点[x, x]表示第x行还可以放置的长度;
- 非叶子结点表示的区间[a, b]维护的是该区间中剩下长度最大的一行的长度。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define FIN freopen("data.in", "r", stdin);
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define Avg(x, y) ((x & y) + ((x ^ y) >> 1))
#define mem(a, v) memset(a,v,sizeof(a))
typedef long long LL;
const int maxn = 200000 + 3;
int tree[maxn * 3];
int h, w, n;
void build(int l, int r, int rt){
tree[rt] = w;
if(l == r) return;
int m = Avg(l, r);
build(lson);
build(rson);
}
int update(int l, int r, int rt, int val){
if(l == r){
if(tree[rt] >= val) tree[rt] -= val;
return l;
}
int m = Avg(l, r), ret = 0;
if(tree[rt<<1] >= val) ret = update(l, m, rt<<1, val);
else ret = update(m+1, r, rt<<1|1, val);
tree[rt] = max(tree[rt<<1], tree[rt<<1|1]);
return ret;
}
int main(){
#ifdef EXMY
FIN
#endif
while(scanf("%d %d %d", &h, &w, &n) != EOF){
build(1, min(h, n), 1);
int board;
for(int i = 0; i < n; ++i){
scanf("%d", &board);
if(tree[1] < board) printf("-1\n");
else{
printf("%d\n", update(1, min(h, n), 1, board));
}
}
}
return 0;
}