st表原理
st表是用来解决RMQ问题(区间最值)的,当然,类似于gcd这种的也可以用st表来解决
它的预处理复杂度是O(nlogn),查询复杂度只有O(1)
模板
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int maxm = 31;
int a[maxn], st[maxn][maxm];
int n, m;
void st_init();
int query(int,int);
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
st_init();
scanf("%d", &m);
while (m--)
{
int l, r;
scanf("%d%d", &l, &r);
printf("%d\n", query(l, r));
}
}
void st_init()
{
for (int j = 0; j <= maxm; j++)
{
for (int i = 1; i + (1 << j) - 1<= n; i++)
{
if (j == 0)
st[i][j] = a[i];
else
st[i][j] = max(st[i][j - 1], st[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(st[l][k], st[r - (1 << k) + 1][k]);
}