http://acm.hdu.edu.cn/showproblem.php?pid=2795
这题由于最多能用到的行数是min(h,n),所以每次就以min(h,n)来建立线段树,树的节点中存放当前区间内所有行中所用长度的最小值,每次更新和查询都要更新到叶子节点,所以我就把更新和查询写到了一个函数里面。以下为代码:
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <iostream>
#include <stack>
#include <map>
#include <string>
#include <iterator>
#include <algorithm>
#include <cmath>
using namespace std;
#define M 200005
struct node
{
int l , r , sum;
}T[M*4];
int h , w , n , m , num[M];
void Build(int l , int r , int rt)
{
T[rt].l = l;
T[rt].r = r;
T[rt].sum = 0;
if (l == r)return;
int mid = (T[rt].l+T[rt].r)>>1;
Build(l,mid,rt<<1);
Build(mid+1,r,rt<<1|1);
}
int Query(int len , int rt)
{
if (w-T[rt].sum < len)return -1;
if (T[rt].l == T[rt].r)
{
T[rt].sum += len;
return T[rt].l;
}
int ret;
if (w-T[rt<<1].sum < len)ret = Query(len,rt<<1|1);
else ret = Query(len,rt<<1);
T[rt].sum = min(T[rt<<1].sum,T[rt<<1|1].sum);
return ret;
}
int main()
{
int i , k;
while (~scanf("%d%d%d",&h,&w,&n))
{
m = min(h,n);
Build(1,m,1);
for (i = 0 ; i < n ; i++)
{
scanf("%d",&k);
printf("%d\n",Query(k,1));
}
}
return 0;
}