Acwing_1273天才的记忆【RMQ算法(ST表)】

输入样例:
6
34 1 8 123 3 2
4
1 2
1 5
3 4
2 3

输出样例:
34
123
123
8

AC代码:

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cmath>
using namespace std;


const int N = 200010,M=18;
int n, m;
int w[N];
int f[N][M];


void init()
{
	//对ST表的预处理
	for (int j = 0; j < M; j++)
		for (int i = 1; i + (1 << j) - 1 <= n; i++)
			if (!j) f[i][j] = w[i];
			else f[i][j] =max(f[i][j - 1],f[i + (1 << (j-1))][j - 1]);
}
int query(int l, int r) {
	int len = r-l+ 1;
	int k = log(len) / log(2);
	return max(f[l][k], f[r - (1 << k) + 1][k]);
}
int main()
{
	scanf("%d", &n);

	for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
	scanf("%d", &m);
	init();

	while (m--) {
		int l, r;
		scanf("%d%d", &l, &r);
		printf("%d\n", query(l, r));
	}

	system("pause");
	return 0;
}