【模板】RMQ（区间查询极值）

最新推荐文章于 2023-11-08 20:34:56 发布

Whyckck

最新推荐文章于 2023-11-08 20:34:56 发布

阅读量181

点赞数

分类专栏： RMQ

本文链接：https://blog.csdn.net/Whyckck/article/details/89067472

版权

RMQ 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

/*#include <iostream>
#include <cstring>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <cstdio>*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef __int128 bll;
const ll maxn = 1e4+100;
const ll mod = 1e9+7;
const ld pi = acos(-1.0);
const ll inf = 1e18;
const ld eps = 1e-5;
const ld e = exp(1);

ll n,q,arr[maxn],dp[maxn][30];

int main()
{	
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
	
	cin >> n;
	for(ll i = 1; i <= n; i++)
	{
		cin >> arr[i];
		dp[i][0] = arr[i];
	}
	
	
	for(ll j = 1; 1<<j <= n; j++)
	{
		for(ll i = 1; i+(1<<j)-1 <= n; i++)
		{
			dp[i][j] = max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);		
		}
	}
	
	cin >> q;
	while(q--)
	{
		ll l,r;
		cin >> l >> r;
		l++,r++;
		
		ll dis = log2((r-l+1));
		
		cout << max(dp[l][dis],dp[r-(1<<dis)+1][dis]) << endl;
		
	}
	
	return 0;
}