UVA 11992 Fast Matrix Operations

线段树。初始为零的矩阵，有三种操作，选出子矩阵来修改，增加，和查询总和，最小值，最大值。可以二维线段树，但仁慈的出题人说：There will be at most twenty rows in the matrix（最多20行）。就可以用一维来解了。注意add标记和set标记的先后逻辑顺序即可。

#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 = 1111111;
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 sum[3][M], add[M], set[M], L, R, n, k, a1, a2, a3, op, v;

void Add(int rt, int m, int val)
{
    sum[0][rt] += m * val;
    sum[1][rt] += val;
    sum[2][rt] += val;
}

void Set(int rt, int m, int val)
{
    sum[0][rt] = m * val;
    sum[1][rt] = val;
    sum[2][rt] = val;
}

void pushup(int rt)
{
    sum[0][rt] = sum[0][rt << 1] + sum[0][rt << 1 | 1];
    sum[1][rt] = min(sum[1][rt << 1], sum[1][rt << 1 | 1]);
    sum[2][rt] = max(sum[2][rt << 1], sum[2][rt << 1 | 1]);
}

void pushdown(int m, int rt)
{
    if(set[rt] != -1)
    {
        set[rt << 1] = set[rt << 1 | 1] = set[rt];
        add[rt << 1] = add[rt << 1 | 1] = 0;
        Set(rt << 1, m - (m >> 1), set[rt]);
        Set(rt << 1 | 1, m >> 1, set[rt]);
        set[rt] = -1;
    }
    if(add[rt])
    {
        add[rt << 1] += add[rt];
        add[rt << 1 | 1] += add[rt];
        Add(rt << 1, m - (m >> 1), add[rt]);
        Add(rt << 1 | 1, m >> 1, add[rt]);
        add[rt] = 0;
    }
}

void update(int l, int r, int rt)
{
    if(L <= l && r <= R)
    {
        if(op == 1)
        {
            add[rt] += v;
            Add(rt, r - l + 1, v);
        }
        else
        {
            add[rt] = 0;
            set[rt] = v;
            Set(rt, r - l + 1, v);
        }
        return;
    }
    pushdown(r - l + 1, rt);
    int m = (l + r) >> 1;
    if(L <= m)update(lson);
    if(R > m) update(rson);
    pushup(rt);
}

void query(int l, int r, int rt)
{
    if(L <= l && r <= R)
    {
        a1 += sum[0][rt];
        a2 = min(a2, sum[1][rt]);
        a3 = max(a3, sum[2][rt]);
        return;
    }
    pushdown(r - l + 1, rt);
    int m = (l + r) >> 1;
    if(L <= m)query(lson);
    if(R > m) query(rson);
    pushup(rt);
}

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

    int q, x1, y1, x2, y2;
    while(RIII(n, k, q) != EOF)
    {
        CLR(sum, 0);
        CLR(add, 0);
        CLR(set, -1);
        while(q--)
        {
            RV(op, x1, y1, x2, y2);
            if(op == 3)
            {
                L = y1 + (x1 - 1) * k;
                R = y2 + (x1 - 1) * k;
                a1 = 0;
                a2 = INFI;
                a3 = -INFI;
                FFF(i, x1, x2)
                {
                    query(1, n * k, 1);
                    L += k;
                    R += k;
                }
                PIS(a1), PIS(a2), PI(a3);
            }
            else
            {
                RI(v);
                L = y1 + (x1 - 1) * k;
                R = y2 + (x1 - 1) * k;
                FFF(i, x1, x2)
                {
                    update(1, n * k, 1);
                    L += k;
                    R += k;
                }
            }
        }
    }
    return 0;
}