11992 - Fast Matrix Operations （线段树）

题目链接：点击打开链接

该题是线段树的区间更新和区间求和操作， 但是注意区间更新的时候有两个操作：修改值和增加值 。    这两个操作在某些情况下会相互影响 。

细节参见代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const int maxn = 1000000 + 5;
int T,v,c,m,r,y11,y2,x1,x2,op,kase=0,_sum,_max,_min;
struct node{
int setv[maxn],minv[maxn],maxv[maxn],sumv[maxn],addv[maxn];
void pushdown(int o) {
    int lc = o*2, rc = o*2+1;
    if(setv[o] >= 0) {
        setv[lc] = setv[rc] = setv[o];
        addv[lc] = addv[rc] = 0;
        setv[o] = -1;
    }
    if(addv[o] > 0) {
        addv[lc] += addv[o];
        addv[rc] += addv[o];
        addv[o] = 0;
    }
}
void maintain(int o, int L, int R) {
    int lc = o*2, rc = o*2+1;
    sumv[o] = minv[o] = maxv[o] = 0;
    if(R > L) {
        sumv[o] = sumv[lc] + sumv[rc];
        minv[o] = min(minv[lc],minv[rc]);
        maxv[o] = max(maxv[lc],maxv[rc]);
    }
    if(setv[o]>=0) { minv[o] = maxv[o] = setv[o]; sumv[o] = setv[o]*(R-L+1); }
    if(addv[o]) { minv[o] += addv[o]; maxv[o] += addv[o]; sumv[o] += addv[o] * (R-L+1); }
}
void update(int o, int L, int R) {
    int lc = o*2, rc = o*2+1;
    if(y11 <= L && y2 >= R) {
        if(op == 1) addv[o] += v;
        else { setv[o] = v; addv[o] = 0; }
    } else {
        pushdown(o);
        int M = L + (R-L)/2;
        if(y11 <= M) update(lc, L, M); else maintain(lc, L, M);
        if(y2 > M) update(rc, M+1, R); else maintain(rc, M+1, R);
    }
    maintain(o, L, R);
}
void query(int o, int L, int R, int add) {
    if(setv[o] >= 0) {
        int v = add + addv[o] + setv[o];
        _sum += v * (min(R,y2)-max(L,y11)+1) ;
        _min = min(_min, v);
        _max = max(_max, v);
    } else if(y11 <= L && y2 >= R) {
        _sum += sumv[o] + add * (R-L+1);
        _min = min(_min, minv[o]+add);
        _max = max(_max, maxv[o]+add);
    } else {
        int M = L + (R-L)/2;
        if(y11 <= M) query(o*2, L, M, add + addv[o]);
        if(y2 > M) query(o*2+1, M+1, R, add + addv[o]);
    }
}
}tree[23];
int main() {
    while(~scanf("%d%d%d",&r,&c,&m)) {
        memset(tree,0,sizeof(tree));
        for(int i=1;i<=r;i++) {
            memset(tree[i].setv,0,sizeof(tree[i].setv));
            tree[i].setv[1] = 0;
        }
        while(m--) {
            scanf("%d%d%d%d%d",&op,&x1,&y11,&x2,&y2);
            if(op == 3) {
                _sum = 0; _min = INF; _max = -INF;
                for(int x = x1; x <= x2; x++) tree[x].query(1,1,c,0);
                printf("%d %d %d\n",_sum,_min,_max);
            }
            else {
                scanf("%d",&v);
                for(int x = x1; x <= x2; x++) tree[x].update(1,1,c);
            }
        }
    }
    return 0;
}