一、题目链接
二、题目分析
(一)算法标签
线段树 RMQ
(二)解题思路
三、AC代码
解法一:
#include <iostream>
#include <climits> // INT_MIN
using namespace std;
const int N = 1e5 + 10;
int n, m;
int w[N];
struct Node{
int l, r, maxv;
}tr[4 * N];
void pushup(int u)
{
tr[u].maxv = max(tr[u << 1].maxv, tr[u << 1 | 1].maxv);
}
void build(int u, int l, int r)
{
if (l == r) tr[u] = {l, r, w[r]};
else
{
tr[u] = {l, r};
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
int query(int u, int l, int r)
{
if (tr[u].l >= l && tr[u].r <= r) return tr[u].maxv;
else
{
int mid = tr[u].l + tr[u].r >> 1;
int maxv = INT_MIN;
if (l <= mid) maxv = max(maxv, query(u << 1, l, r));
if (r > mid) maxv = max(maxv, query(u << 1 | 1, l, r));
return maxv;
}
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
build(1, 1, n);
while (m -- )
{
int l, r;
scanf("%d%d", &l, &r);
printf("%d\n", query(1, l, r));
}
return 0;
}