HYSBZ 1067 降雨量 RMQ

题意：给出年份和每年的降雨量，还有q个询问，每次询问给两个年份，若说y2为自y1以来降雨量最多的年份，则y2的降雨量不超过y1，且y1到y2中各年份的降雨量不超过y2的降雨量，说法保证正确输出true，保证错误输出false，若可能正确输出maybe
思路：首先用st表存区间最大值，之后分情况讨论，若y1、y2都存在且满足条件输出true，若y1、y2之间某个年份不存在，满足条件输出maybe，若y1或者y2其中一个不存在，则中间年份满足条件输出maybe，若两个都不存在输出maybe，其他不满足条件的输出false

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 50005;
ll n, rain[maxn], year[maxn], q, maxx[maxn][50];
ll getMax(ll l, ll r)
{
	if (l > r)
		return 0;
	ll k = log(r-l+1)/log(2.0);
	return max(maxx[l][k], maxx[r-(1<<k)+1][k]);
}
int main()
{
	while (~scanf("%lld", &n)) {
		memset(rain, 0, sizeof(rain));
		memset(year, 0, sizeof(year));
		for (ll i = 1; i <= n; i++) {
			ll y, r;
			scanf("%lld%lld", &y, &r);
			rain[i] = r;
			year[i] = y;
			maxx[i][0] = rain[i];
		}
		for (ll i = n; i >= 1; i--)
			for (ll j = 1; i+(1<<j)-1 <= n; j++) {
				maxx[i][j] = max(maxx[i][j-1], maxx[i+(1<<j-1)][j-1]);
			}
		scanf("%lld", &q);
		if (n == 0 && q == 0) 
			break;
		for (ll i = 0; i < q; i++) {
			ll y1, y2;
			scanf("%lld%lld", &y1, &y2);
			ll l=lower_bound(year+1,year+n+1,y1)-year;
            ll r=lower_bound(year+1,year+n+1,y2)-year;
			if (year[l] == y1 && year[r] == y2 && r-l == y2-y1 && rain[l] >= rain[r]) {
				ll x = getMax(l+1, r-1);
				if (x < rain[r])
					printf("true\n");
				else
					printf("false\n");
			}
			else if (year[l] == y1 && year[r] == y2 && r-l != y2-y1 && rain[l] >= rain[r]) {
				ll x = getMax(l+1, r-1);
				if (x < rain[r])
					printf("maybe\n");
				else
					printf("false\n");
			}
			else if (year[l] != y1 && year[r] == y2) {
				ll x = getMax(l, r-1);
				if (x < rain[r])
					printf("maybe\n");
				else
					printf("false\n");
			}
			else if (year[l] == y1 && year[r] != y2) {
				ll x = getMax(l+1, r-1);
				if (x < rain[l])
					printf("maybe\n");
				else
					printf("false\n");
			}
			else if (year[l] != y1 && year[r] != y2) {
				printf("maybe\n");
			}
			else
				printf("false\n");
		}
	}
	return 0;
}