HDU 2795 Billboard

  这题是用线段树做，把H当做叶子节点，设置左儿子最大值，和右儿子最大值两个数组，如果左儿子大就往左儿子查找，右儿子大就往右儿子查找。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#define maxn 200000
#define mem(a) memset(a, 0, sizeof(a))
using namespace std;

long v[maxn * 4 + 5], lv[maxn * 4 + 5], rv[maxn * 4 + 5], val, flag;

void build(long l, long r, long long n)
{
	if(l == r)
	{
		v[n] = val;
		lv[n] = val;
		rv[n] = val;
		return;
	}
	long mid = (l + r) / 2;
	build(l, mid, n * 2);
	build(mid + 1, r, n * 2 + 1); 
	lv[n] = max(lv[n * 2], rv[n * 2]);
	rv[n] = max(lv[n * 2 + 1], rv[n * 2 + 1]);
}

void add(long l, long r, long long n, long vl)
{
	if(flag == 1)
	return;
	if(l == r&&v[n] >= vl)
	{
		printf("%ld\n", l);
		flag = 1;
		v[n] -= vl;
		lv[n] = v[n];
		rv[n] = v[n];
	    return;
	}
	if(lv[n] < vl&&rv[n] < vl)
	return;
	long mid = (l + r) / 2;
	if(lv[n] >= vl)
	add(l, mid, n * 2, vl);
	else
	add(mid + 1, r, n * 2 + 1, vl);
	lv[n] = max(lv[n * 2], rv[n * 2]);
	rv[n] = max(lv[n * 2 + 1], rv[n * 2 + 1]);
}

int main(int argc, char *argv[])
{
	long h, n, i, a;
	while(scanf("%ld%ld%ld", &h, &val, &n) != EOF)
	{
		mem(v);
		mem(lv);
		mem(rv);
		if(h > n)
		h = n;
		build(1, h, 1);
		for(i = 0;i < n;i++)
		{
			flag = 0;
			scanf("%ld", &a);
			add(1, h, 1, a);
			if(!flag)
			printf("-1\n");
		}
	}
	return 0;
}