POJ-3264 Balanced Lineup(rmq模板题)

题意：

给一组数字，然后给出两数l，r，输出区间l到r的最大数和最小数的差。

模板：

#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 5e4+5;
int a[maxn];
int f1[maxn][20], f2[maxn][20];
int n, q;
void rmq_init()
{
	for(int i = 1; i <= n; ++i) f1[i][0] = f2[i][0] = a[i];
	for(int j = 1; (1<<j) <= n; ++j)
	for(int i = 1; i+(1<<j)-1 <= n; ++i)
	f1[i][j] = min(f1[i][j-1], f1[i+(1<<(j-1))][j-1]),
	f2[i][j] = max(f2[i][j-1], f2[i+(1<<(j-1))][j-1]);
}
int rmq(int l, int r)
{
	int k = log2(r-l+1);
	return max(f2[l][k], f2[r-(1<<k)+1][k]) - min(f1[l][k], f1[r-(1<<k)+1][k]);
}
int main()
{
	scanf("%d %d", &n, &q);
	for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	rmq_init();
	while(q--)
	{
		int l, r;
		scanf("%d %d", &l, &r);
		printf("%d\n", rmq(l, r));
	}
	return 0;
}

继续加油~