#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define PB(x)(scanf("%I64d",&x))
#define PRB(x)(printf("%I64d\n",(x)))
typedef __int64 LL;
#define N 200005
#define M 105
#define Mod 1000
#define Inf 0x7fffffff
#define L(x) (x<<1)
#define R(x) ((x<<1)|1)
#define For(i,n) for(int i=0;i<n;i++)
#define lowbit(x) (x) & (-x)
#define mid(x,y) ((x+y)>>1)
struct tree
{
int l,r;
int sum;
};
tree T[4*N];
int h,w,n;
int ar[N];
inline int maxx(int a,int b)
{
return a>b?a:b;
}
inline int minx(int a,int b)
{
return a>b?b:a;
}
void build(int l,int r,int k,int len)
{
T[k].l = l;
T[k].r = r;
T[k].sum = len;
if(l == r) return ;
int mi = mid(l,r);
build(l,mi,L(k),len);
build(mi+1,r,R(k),len);
}
int update(int len,int k)
{
if(T[k].l == T[k].r)
{
if(T[k].sum>=len)
{T[k].sum -= len; return T[k].l;}
return -1;
}
if(T[k].sum<len) return -1;
int kk = -1;
if(T[L(k)].sum>=len) kk = update(len,L(k));
else if(T[R(k)].sum>=len) kk = update(len,R(k));
T[k].sum = maxx(T[L(k)].sum,T[R(k)].sum);
if(kk>h) return -1;
return kk;
}
void init()
{
while(scanf("%d%d%d",&h,&w,&n)!=EOF)
{
build(1,n,1,w);
int x;
For(i,n)
{
PF(x);
PR(update(x,1));
}
}
return ;
}
int main()
{
init();
return 0;
}
hdu 2795
最新推荐文章于 2021-10-15 21:28:06 发布