救命大佬们，我看应该不会有错的。

#include <iostream>
using namespace std;

int main(void) {
	long long n, m;
	cin >> n >> m;
	long long a[n + 1] = {0}, zui[n + 1][n + 1] = {0}, t[m + 1] = {0};
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	zui[0][0] = 0;
	for (int i = 1; i <= n; i++) {
		zui[i][0] = a[i];
		for (int j = 1; j <= n - i; j++) {
			zui[i][j] = max(zui[i][j - 1], a[i + j]);
		}
	}
	for (int j = 1; j <= m; j++) {
		long long k, f;
		cin >> k >> f;
		t[j] = zui[k][f - k];
	}
	for (int i = 1; i <= m; i++)
		cout << t[i] << endl;
}