区间最小值查询

hdu2888：http://acm.hdu.edu.cn/showproblem.php?pid=2888

rmq(Range Minimum Query)：给出n个元素的数组，计算min(al, al + 1, al + 2……,ar);

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>

using namespace std;

const int MAXN = 300 + 1;
int d[MAXN][MAXN][9][9];
int a[MAXN][MAXN];
int n, m;

bool ok(int x1, int y1, int x2, int y2, int value)
{
    if (a[x1][y1] == value || a[x2][y2] == value) return true;
    else if (a[x2][y1] == value || a[x1][y2] == value) return true;
    return false;
}

void init_rmq()
{
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            d[i][j][0][0] = a[i][j];

    for (int i = 0; (1 << i) <= n; i++)
        for (int j = 0; (1 << j) <= m; j++)
        {
            if (i == 0 && j == 0) continue;

            for (int row = 0; row + (1 << i) - 1 < n; row++)
                for (int col = 0; col + (1 << j) - 1 < m; col++)
                {
                    if (i == 0)
                        d[row][col][i][j] = max(d[row][col][i][j - 1], d[row][col + (1 << (j - 1))][i][j - 1]);
                    else
                        d[row][col][i][j] = max(d[row][col][i - 1][j], d[row + (1 << (i - 1))][col][i - 1][j]);
                }
        }
}

int rmq(int x1, int y1, int x2, int y2)
{
    int k1 = 0, k2 = 0, ans = 0;
    while ((1 << (k1 + 1) <= x2 - x1 + 1)) k1++;
    while ((1 << (k2 + 1) <= y2 - y1 + 1)) k2++;
    ans = max(d[x1][y1][k1][k2], d[x2 - (1 << k1) + 1][y2 - (1 << k2) + 1][k1][k2]);
    ans = max(max(d[x2 - (1 << k1) + 1][y1][k1][k2], d[x1][y2 - (1 << k2) + 1][k1][k2]), ans);
    return ans;
}

void input()
{
    int x1, x2, y1, y2;
    while (cin >> n >> m)
    {
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                scanf("%d", &a[i][j]);

        init_rmq();
        int mx = 0, q;

        cin >> q;

        for (int i = 0; i < q; i++)
        {
            scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
            mx = rmq(x1 - 1, y1 - 1, x2 - 1, y2 - 1);
            printf("%d %s\n", mx, ok(x1 - 1, y1 - 1, x2 - 1, y2 - 1, mx) ? "yes" : "no");
        }
    }
}

int main()
{
    input();
    return 0;
}