UVa 11992 Fast Matrix Operations （线段树区间修改大杂烩）

        题目链接：http://vjudge.net/problem/18697

       这就是一个线段树区间修改的大杂烩，涉及区间加值，区间赋值，区间查询等等。只不过这是个矩阵，所以要对每一行分别建立一棵线段树再进行操作。但是有一点要搞清楚，如果既有赋值标记，又有加值标记。要先执行赋值，再执行加值。因为我们给区间赋值时会把加值的标记给去掉，因此若是既有赋值标记又有加值标记则说明是先赋的值然后再加的值。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lc rt<<1
#define rc rt<<1|1
using namespace std;

typedef long long ll;
const int maxnode = 1<<17;
const int maxn = 20 + 5;
const int INF = 1e8 + 10;
int op, x1, x2, y1, y2, v;
struct IntervalTree
{
    int sumv[maxnode], addv[maxnode], minv[maxnode], maxv[maxnode], setv[maxnode];

    void PushUp(int rt) {
       sumv[rt] = sumv[lc] + sumv[rc];
       maxv[rt] = max(maxv[lc], maxv[rc]);
       minv[rt] = min(minv[lc], minv[rc]);
    }
    void PushDown(int rt, int m) {
        if (setv[rt] >= 0) {
            setv[lc] = setv[rc] = setv[rt];
            addv[lc] = addv[rc] = 0;
            sumv[lc] = setv[rt] * (m - (m>>1));
            sumv[rc] = setv[rt] * (m >> 1);
            maxv[lc] = maxv[rc] = minv[lc] = minv[rc] = setv[rt];
            setv[rt] = -1;
        }
        if (addv[rt] != 0) {
            addv[lc] += addv[rt];
            addv[rc] += addv[rt];
            sumv[lc] += addv[rt] * (m - (m>>1));
            sumv[rc] += addv[rt] * (m >> 1);
            maxv[lc] += addv[rt];
            maxv[rc] += addv[rt];
            minv[lc] += addv[rt];
            minv[rc] += addv[rt];
            addv[rt] = 0;
        }
    }

    void build(int l, int r, int rt) {
        if (l == r) {
            sumv[rt] = maxv[rt] = minv[rt] = addv[rt] = 0;
            setv[rt] = -1;
        }
        else {
            int m = (l + r) >> 1;
            build(lson);
            build(rson);
            PushUp(rt);
        }
    }

    void update(int l, int r, int rt) {
        if (y1 <= l && r <= y2) {
            if (op == 1) {
                addv[rt] += v;
                sumv[rt] += v * (r-l+1);
                minv[rt] += v;
                maxv[rt] += v;
            }
            else if (op == 2) {
                addv[rt] = 0;
                setv[rt] = v;
                sumv[rt] = v * (r-l+1);
                minv[rt] = maxv[rt] = v;
            }
        }
        else {
            PushDown(rt, r-l+1);
            int m = (l + r) >> 1;
            if (y1 <= m) update(lson);
            if (y2 > m) update(rson);
            PushUp(rt);
        }
    }

    ll query(int l, int r, int rt, int &mi, int &mx) {
        if (y1 <= l && r <= y2) {
           mx = max(mx, maxv[rt]);
           mi = min(mi, minv[rt]);
           return sumv[rt];
        }
        else {
            PushDown(rt, r-l+1);
            int m = (l + r) >> 1;
            ll sum = 0;
            if (y1 <= m) sum += query(lson, mi, mx);
            if (y2 > m) sum += query(rson,mi,mx);
            return sum;
        }
    }

}tree[maxn];

int main()
{
    int r,c,q;
    while(scanf("%d%d%d",&r,&c,&q) == 3) {
        for (int i = 1; i <= r; i++) {
           tree[i].build(1, c, 1);
           tree[i].setv[1] = 0;
        }
        while(q--) {
            scanf("%d%d%d%d%d",&op, &x1, &y1, &x2, &y2);
            if (op < 3) {
              scanf("%d",&v);
              for (int i = x1; i <= x2; i++)
                tree[i].update(1,c,1);
            }
            else {
               int sum = 0, mx = -1, mi = INF;
               for (int i = x1; i <= x2; i++) {
                   sum += tree[i].query(1,c,1,mi,mx);
               }
               printf("%d %d %d\n",sum,mi,mx);
            }
        }
    }
    return 0;
}