https://www.luogu.org/problem/show?pid=1816 忠诚
RMQ模板题,用tarjan的ST算法,用f[i][j]
表示从i开始长度为2^j的区间最小值,dp预处理即可。询问时用从l,r分别为端点的长度为k的f值取min即可(k是使
2k≤r−l+1
的最大数)。这样可以在线查询做到
O(nlogn)−O(logn)
;预处理k可以做到
O(nlogn)−O(1)
,但因为此题询问和n同阶,无需这么做。(ST表具体内容不赘述,网上资料很多)
代码:
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N], f[N][35], n;
void rmq_pre () {
for (int j = 1; 1<<j <= n; ++ j)
for (int i = 1; i+(1<<j)-1 <= n; ++ i)
f[i][j] = min (f[i][j-1], f[i+(1<<(j-1))][j-1]);
}
int rmq_qry (int l, int r) {
int k = 0;
while (1<<(k+1) <= r-l+1) ++ k;
return min (f[l][k], f[r-(1<<k)+1][k]);
}
int main () {
int m, l, r; scanf ("%d%d", &n, &m);
for (int i = 1; i <= n; ++ i) {
scanf ("%d", &a[i]); f[i][0] = a[i];
} rmq_pre ();
while (m--) {
scanf ("%d%d", &l, &r);
printf ("%d ", rmq_qry (l, r));
} puts ("");
return 0;
}