Monitor 【CodeForces - 846D】【二维线段树】

题目链接

---

   二维线段树维护区间最大值，然后再用区间暴力查询即可。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1e9+7;
const int maxN = 505;
int N, M, K, Q, tree[maxN<<2][maxN<<2];
void build_In(int fa, int ml, int mr, int rt, int l, int r)
{
    if(l == r)
    {
        tree[fa][rt] = INF;
        return;
    }
    int mid = (l + r)>>1;
    build_In(fa, ml, mr, rt<<1, l, mid);
    build_In(fa, ml, mr, rt<<1|1, mid+1, r);
    tree[fa][rt] = INF;
}
void build_Out(int rt, int l, int r)
{
    if(l == r)
    {
        build_In(rt, l, r, 1, 1, M);
        return;
    }
    int mid = (l + r)>>1;
    build_Out(rt<<1, l, mid);
    build_Out(rt<<1|1, mid+1, r);
    build_In(rt, l, r, 1, 1, M);
}
void update_In(int fa, int ml, int mr, int rt, int l, int r, int qx, int val)
{
    if(l == r)
    {
        if(ml == mr) tree[fa][rt] = val;
        else tree[fa][rt] = max(tree[fa<<1][rt], tree[fa<<1|1][rt]);
        return;
    }
    int mid = (l + r)>>1;
    if(qx>mid) update_In(fa, ml, mr, rt<<1|1, mid+1, r, qx, val);
    else update_In(fa, ml, mr, rt<<1, l, mid, qx, val);
    tree[fa][rt] = max(tree[fa][rt<<1], tree[fa][rt<<1|1]);
}
void update_Out(int rt, int l, int r, int qx, int qy, int val)
{
    if(l == r)
    {
        update_In(rt, l, r, 1, 1, M, qy, val);
        return;
    }
    int mid = (l + r)>>1;
    if(qx>mid) update_Out(rt<<1|1, mid+1, r, qx, qy, val);
    else update_Out(rt<<1, l, mid, qx, qy, val);
    update_In(rt, l, r, 1, 1, M, qy, val);
}
int query_In(int fa, int ml, int mr, int rt, int l, int r, int ql, int qr)
{
    if(ql<=l && qr>=r) return tree[fa][rt];
    int mid = (l + r)>>1;
    if(ql>mid) return query_In(fa, ml, mr, rt<<1|1, mid+1, r, ql, qr);
    else if(qr<=mid) return query_In(fa, ml, mr, rt<<1, l, mid, ql, qr);
    else return max(query_In(fa, ml, mr, rt<<1, l, mid, ql, qr), query_In(fa, ml, mr, rt<<1|1, mid+1, r, ql, qr));
}
int query_Out(int rt, int l, int r, int qlx, int qly, int qrx, int qry)
{
    if(qlx<=l && qrx>=r) return query_In(rt, l, r, 1, 1, M, qly, qry);
    int mid = (l + r)>>1;
    if(qlx>mid) return query_Out(rt<<1|1, mid+1, r, qlx, qly, qrx, qry);
    else if(qrx<=mid) return query_Out(rt<<1, l, mid, qlx, qly, qrx, qry);
    else return max(query_Out(rt<<1|1, mid+1, r, qlx, qly, qrx, qry), query_Out(rt<<1, l, mid, qlx, qly, qrx, qry));
}
int main()
{
    while(scanf("%d%d%d%d", &N, &M, &K, &Q)!=EOF)
    {
        build_Out(1, 1, N);
        int x, y, t;
        while(Q--)
        {
            scanf("%d%d%d", &x, &y, &t);
            update_Out(1, 1, N, x, y, t);
        }
        int ans = INF;
        for(int i=1; i+K-1<=N; i++)
        {
            for(int j=1; j+K-1<=M; j++)
            {
                ans = min(ans, query_Out(1, 1, N, i, j, i+K-1, j+K-1));
            }
        }
        printf("%d\n", ans==INF?(-1):ans);
    }
    return 0;
}