bzoj 1067: [SCOI2007]降雨量

显然的线段树然后分段讨论

然后我用RMQ做了一下一直WA也不知道为何，，，果断换线段树

先映射点：离散化。然后需要讨论有没有这个点、中间点的点有没有、对答案的影响就行了

wa的RMQ

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define MAX 52009
#define rep(i, j, k) for(int i = j; i <= k; i++)

using namespace std;

int n, m, f[MAX][30];
int a[MAX], b[MAX];

inline int ask (int l, int r)
{
	if (l > r)
		return -0x7fffffff;
	int t = 0;
	while (1 << (t + 1) <= r - l + 1)
		t++;
	return max (f[l][t], f[r - (1 << t) + 1][t]);
}

int main()
{
	scanf ("%d", &n);
	rep (i, 1, n)
		scanf ("%d%d", &a[i], &b[i]);
	rep (i, 1, n)
		f[i][0] = b[i];
	for (int j = 1; (1 << j) <= n; j++)
		for (int i = 1; i + (1<<j) - 1 <= n; i ++)
			f[i][j] = max (f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);

	scanf ("%d", &m);
	while (m--)
	{
		int a1, a2, l, r;
		scanf ("%d%d", &a1, &a2);
		l = lower_bound (a + 1, a + 1 + n, a1) - a;
		r = lower_bound (a + 1, a + 1 + n, a2) - a;
		int fu = (a2 - a1 +1 == r - l + 1);
		if (a[r] != a2 && a[l] != a1)
		{
			printf ("maybe\n");
			continue;
		}
		if (a[r] != a2)
		{
			int Max = ask (l + 1, r - 1);
			if (Max <= b[l])//or < ??
				printf ("maybe\n");
			else
				printf ("false\n");
			continue;
		}
		if (a[l] != a1)
		{
			int Max = ask (l, r - 1);
			if (b[r] > Max)
				printf ("maybe\n");
			else
				printf ("false\n");
			continue;
		}
		if (b[r] > b[l])
		{
			printf ("false\n");
			continue;
		}
		if (fu)
		{
			int Max = ask (l + 1, r - 1);
			if (Max < b[r] && b[r] <= b[l])
				printf("true\n");
			else
				printf("false\n");
			continue;
		}
		else
		{
			int Max = ask (l + 1, r - 1);
			if (Max < b[r] && b[r] <= b[l])
				printf ("maybe\n");
			else
				printf ("false\n");
		}
	}
	return 0;
}

线段树：

//省略2000字