[hdu2888]二维RMQ

题意：求矩形内最大值。二维RMQ。

#pragma comment(linker, "/STACK:10240000,10240000")

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <ctime>
#include <cctype>
#include <set>

using namespace std;

#define mem0(a) memset(a, 0, sizeof(a))
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define define_m int m = (l + r) >> 1
#define Rep(a, b) for(int a = 0; a < b; a++)
#define lowbit(x) ((x) & (-(x)))
#define constructInt4(name, a, b, c, d) name(int a = 0, int b = 0, int c = 0, int d = 0): a(a), b(b), c(c), d(d) {}
#define constructInt3(name, a, b, c) name(int a = 0, int b = 0, int c = 0): a(a), b(b), c(c) {}
#define constructInt2(name, a, b) name(int a = 0, int b = 0): a(a), b(b) {}

typedef double db;
typedef long long LL;
typedef pair<int, int> pii;
typedef multiset<int> msi;
typedef multiset<int>::iterator msii;
typedef set<int> si;
typedef set<int>::iterator sii;
typedef vector<int> vi;

const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
const int maxn = 1e5 + 7;
const int maxm = 1e5 + 7;
const int maxv = 1e7 + 7;
const int MD = 1e9 +7;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-10;

int a[300][300], t[301], f[300][9][300][9], n, m;

void Init_RMQ() {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            f[i][0][j][0] = a[i][j];
        }
    }
    for (int dx = 0; dx <= 8; dx++) {
        for (int dy = 0; dy <= 8; dy++) {
            if (dx == 0 && dy == 0) continue;
            for (int i = 0; i + (1 << dx) <= n; i++) {
                for (int j = 0; j + (1 << dy) <= m; j++) {
                   int &p = f[i][dx][j][dy];
                    if (dx) p = max(f[i][dx - 1][j][dy], f[i + (1 << (dx - 1))][dx - 1][j][dy]);
                    else p = max(f[i][dx][j][dy - 1], f[i][dx][j + (1 << (dy - 1))][dy - 1]);
                }
            }
        }
    }
}

int RMQ(int x1, int y1, int x2, int y2) {
    int l1 = t[x2 - x1 + 1], l2 = t[y2 - y1 + 1];
    return max(f[x1][l1][y1][l2], max(f[x1][l1][y2 - (1 << l2) + 1][l2],
            max(f[x2 - (1 << l1) + 1][l1][y1][l2], f[x2 - (1 << l1) + 1][l1][y2 - (1 << l2) + 1][l2])));
}

int main() {
    //freopen("in.txt", "r", stdin);
    for (int i = 1; i <= 300; i++) {
        int j = 0;
        while ((1 << (j + 1)) <= i) j++;
        t[i] = j;
    }
    int x1, x2, y1, y2, q;
    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();
        cin >> q;
        for (int i = 0; i < q; i++) {
            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
            x1--; x2--; y1--; y2--;
            int res = RMQ(x1, y1, x2, y2);
            printf("%d ", res);
            if (a[x1][y1] == res || a[x2][y1] == res || a[x1][y2] == res || a[x2][y2] == res) puts("yes");
            else puts("no");
        }
    }
    return 0;
}