POJ 2019 Cornfields

二维线段树。本想练练二维RMQ的，结果就线段树水过了。求区间内最大值减最小值的差。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<map>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", s)
#define PC(n) printf("Case %d: ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1e9+7;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const int N = 300;
const int M = N << 2;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

int m1[M][M], m2[M][M], n, x1, x2, y1, y2, a1, a2;

void pushup(int x, int y)
{
    m1[x][y] = max(m1[x][y << 1], m1[x][y << 1 | 1]);
    m2[x][y] = min(m2[x][y << 1], m2[x][y << 1 | 1]);
}

void build1(int f, int x0, int l, int r, int rt)
{
    if(l == r)
    {
        if(f)
        {
            int k;
            RI(k);
            m1[x0][rt] = m2[x0][rt] = k;
        }
        else
        {
            m1[x0][rt] = max(m1[x0 << 1][rt], m1[x0 << 1 | 1][rt]);
            m2[x0][rt] = min(m2[x0 << 1][rt], m2[x0 << 1 | 1][rt]);
        }
        return;
    }
    int m = (l + r) >> 1;
    build1(f, x0, lson);
    build1(f, x0, rson);
    pushup(x0, rt);
}

void build(int l, int r, int rt)
{
    if(l == r)
    {
        build1(1, rt, 1, n, 1);
        return;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    build1(0, rt, 1, n, 1);
}

void query1(int x0, int l, int r, int rt)
{
    if(y1 <= l && r <= y2)
    {
        a1 = max(a1, m1[x0][rt]);
        a2 = min(a2, m2[x0][rt]);
        return;
    }
    int m = (l + r) >> 1;
    if(y1 <= m)query1(x0, lson);
    if(y2 > m) query1(x0, rson);
}

void query(int l, int r, int rt)
{
    if(x1 <= l && r <= x2)
    {
        query1(rt, 1, n, 1);
        return;
    }
    int m = (l + r) >> 1;
    if(x1 <= m)query(lson);
    if(x2 > m) query(rson);
}

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int b, m;
    while(RIII(n, b, m) != EOF)
    {
        build(1, n, 1);
        while(m--)
        {
            RII(x1, y1);
            x2 = x1 + b - 1;
            y2 = y1 + b - 1;
            a1 = -1;
            a2 = N;
            query(1, n, 1);
            PI(a1 - a2);
        }
    }
    return 0;
}