RMQ模板

一维 

#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 100010;
int dp[MAXN][20];
int mm[MAXN];
int dp1[MAXN][20];
int mm1[MAXN];
//初始化 RMQ, b 数组下标从 1 开始,从 0 开始简单修改
void Init_Max(int n, int b[])
{
    mm[0] = - 1;
    for (int i = 1; i <= n; i++)
    {
        mm[i] = ((i & (i - 1)) == 0) ? mm[i - 1] + 1 : mm[i - 1];
        dp[i][0] = b[i];
    }
    for (int j = 1; j <= mm[n]; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            dp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
}
void Init_Min(int n, int b[])
{
    mm[0] = - 1;
    for (int i = 1; i <= n; i++)
    {
        mm[i] = ((i & (i - 1)) == 0) ? mm[i - 1] + 1 : mm[i - 1];
        dp[i][0] = b[i];
    }
    for (int j = 1; j <= mm[n]; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
}
//查询最大值
int Query_Max(int x, int y)
{
    int k = mm[y - x + 1];
    return max(dp[x][k], dp[y - (1 << k) + 1][k]);
}

int Query_Min(int x, int y)
{
    int k = mm[y - x + 1];
    return min(dp[x][k], dp[y - (1 << k) + 1][k]);
}

int n, a[MAXN], q, l, r;

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n;i++)
        scanf("%d", &a[i]);
    Init_Min(n, a);
    scanf("%d", &q);
    while(q--)
    {
        scanf("%d %d", &l, &r);
        printf("%d\n", Query_Min(l, r));
    }
    return 0;
}

 

二维 

//求最小值把 max 改为 min 即可#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 100010;
int val[310][310];
int dp[310][310][9][9]; //最大值
int mm[310];            //二进制位数减一,使用前初始化
void initRMQ(int n, int m)
{
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            dp[i][j][0][0] = val[i][j];
    for (int ii = 0; ii <= mm[n]; ii++)
        for (int jj = 0; jj <= mm[m]; jj++)
            if (ii + jj)
                for (int i = 1; i + (1 << ii) - 1 <= n; i++)
                    for (int j = 1; j + (1 << jj) - 1 <= m; j++)
                    {
                        if (ii)
                            dp[i][j][ii][jj] = max(dp[i][j][ii
- 1][jj], dp[i + (1 << (ii - 1))][j][ii - 1][jj]);
                        else
                            dp[i][j][ii][jj] = max(dp[i][j][ii][jj
- 1], dp[i][j + (1 << (jj - 1))][ii][jj - 1]);
                    }
}
//查询矩形内的最大值 (x1<=x2,y1<=y2)
int rmq(int x1, int y1, int x2, int y2)
{
    int k1 = mm[x2 - x1 + 1];
    int k2 = mm[y2 - y1 + 1];
    x2 = x2 - (1 << k1) + 1;
    y2 = y2 - (1 << k2) + 1;
    return max(max(dp[x1][y1][k1][k2], dp[x1][y2][k1][k2]), max(dp[x2][y1][k1][k2], dp[x2][y2][k1][k2]));
}
int main()
{
    //在外面对 mm 数组进行初始化
    mm[0] = - 1;
    for (int i = 1; i <= 305; i++)
        mm[i] = ((i & (i - 1)) == 0) ? mm[i - 1] + 1 : mm[i - 1];
    int n, m;
    int Q;
    int r1, c1, r2, c2;
    while (scanf("%d%d", &n, &m) != EOF)
    {
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                scanf("%d", &val[i][j]);
        initRMQ(n, m);
        scanf("%d", &Q);
        while (Q -- )
        {
            scanf("%d%d%d%d", &r1, &c1, &r2, &c2);
            if (r1 > r2)
                swap(r1, r2);
            if (c1 > c2)
                swap(c1, c2);
            int tmp = rmq(r1, c1, r2, c2);
            printf("%d", tmp);
            if (tmp == val[r1][c1] || tmp == val[r1][c2] || tmp == val[r2][c1] || tmp == val[r2][c2])
                printf("yes\n");
            else
                printf("no\n");
        }
    }
    return 0;
}