HDU 3016 Man Down（线段树 + DP）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3016

 

题意：一个人从高处往下垂直下落，每次可以从该木板的两端下落到最近的且包含该端点的木板上，一开始血量为100，跳到某个木板上可能回血或扣血，当血量 <= 0时该游戏结束，问跳到地面血量最多为多少

 

思路：首先要考虑如何寻找下次能跳的最近的左右两木板这一问题，我们可以将木板升序排列，对于每块木板的两端点，查询它们被谁覆盖，然后再用当前区间去更新线段树。

对于寻求最多血量，有转移方程：d[left] = max(dp[left], dp[i] + a[a[i].left].w)

 

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

const int MAXN = 101000;
const int MAXM = 101000;
const int INF = 0x3f3f3f3f;

typedef long long ll;

int col[MAXN << 2];

struct node
{
	int l, r, h, w;
	int left, right;

	bool operator < (const node &rhs) const
	{
		return h < rhs.h;
	}
} a[MAXN];

int dp[MAXN];

void pushdown(int rt)
{
	if (col[rt])
	{
		col[rt << 1 | 1] = col[rt << 1] = col[rt];
		col[rt] = 0;
	}
}

void build(int l, int r, int rt)
{
	col[rt] = 0;
	if (l == r)
		return ;

	int mid = (l + r) >> 1;
	build(lson);
	build(rson);
}

void update(int ql, int qr, int c, int l, int r, int rt)
{
	if (ql <= l && qr >= r)
	{
		col[rt] = c;
		return ;
	}

	pushdown(rt);
	int mid = (l + r) >> 1;
	if (ql <= mid)
		update(ql, qr, c, lson);
	if (qr > mid)
		update(ql, qr, c, rson);
}

int query(int p, int l, int r, int rt)
{
	if (l == r)
		return col[rt];

	pushdown(rt);
	int mid = (l + r) >> 1;
	if (p <= mid)
		return query(p, lson);
	else
		return query(p, rson);
}

int main()
{
	int n;
	while (~scanf("%d", &n))
	{
		n++;
		int L = 1, R = 100010;

		build(L, R, 1);
		a[1].l = L, a[1].r = R, a[1].h = 0, a[1].w = 0;
		for (int i = 2; i <= n; i++)
			scanf("%d%d%d%d", &a[i].h, &a[i].l, &a[i].r, &a[i].w);

		sort(a + 1, a + n + 1);
		for (int i = 1; i <= n; i++)
		{
			a[i].left = query(a[i].l, L, R, 1);
			a[i].right = query(a[i].r, L, R, 1);
			update(a[i].l, a[i].r, i, L, R, 1);
		}

		memset(dp, -INF, sizeof(dp));
		dp[n] = 100 + a[n].w;
		for (int i = n; i >= 1; i--)
		{
			if (dp[i] > 0)
			{
				dp[a[i].left] = max(dp[a[i].left], dp[i] + a[a[i].left].w);
				dp[a[i].right] = max(dp[a[i].right], dp[i] + a[a[i].right].w);
			}
		}
		if (dp[1] > 0)
			cout << dp[1] << endl;
		else
			cout << -1 << endl;
	}
	return 0;
}