hdu 2795 Billboard（线段树）

#include <iostream>
using namespace std;
#include <string.h>
#include <stdio.h>
#include <queue>
#include <algorithm>
#define m1 888888
int vis[m1],m;
void build( int l, int r ,int rt )//rt编号
{
if( l == r )
{
vis[rt]=m;
return ;
}
int m = ( l + r ) >> 1;
build( l, m, rt<<1 );
build( m+1, r, rt<<1|1);
vis[rt]=max(vis[rt<<1],vis[rt<<1|1]);
}
int query( int len, int l, int r, int rt )
{
if( l == r )
{
vis[rt]-=len;
return l;
}
int m = ( l + r ) >> 1;
int ret;
if( vis[rt<<1] >= len ) ret =query(len,l,m,rt<<1);//左子树有比len大的就走左边
else ret =query(len,m+1,r,rt<<1|1);//否则走右边
vis[rt]=max(vis[rt<<1],vis[rt<<1|1]);//更新数据
return ret;
}
int main()
{
int n, k;
while( scanf ( "%d %d %d", &n, &m, &k ) != EOF )
{
if(k<n) n=k;
build(1,n,1);
while(k--)
{
int x;
scanf ( "%d", &x );
if(x>vis[1]) printf("-1\n");//比树的顶点（最大值）大，放不进去
else printf("%d\n",query(x,1,n,1));
}
}
return 0;
}