UVA-11992（线段树最复杂的题之一，二维，set,add同时存在，王泥煤DL的代码，本菜鸡抄都差点抄不对）

#include"stdafx.h"
#include<bits/stdc++.h>
#define inf 0x7fffffff
using namespace std;
const int maxn = 1e6 + 5;
long long _sum, _min, _max;
long long dat[maxn << 2], setv[maxn << 2];
int v, ql, qr ,op;//该模板从dat[1]开始，父节点存储子节点之和,v存入变化量
struct IntervalTree{
	long long sumv[maxn << 1], minv[maxn << 1], maxv[maxn << 1], addv[maxn << 1], setv[maxn << 1];
	void init() {
		memset(maxv, 0, sizeof(maxv));
		memset(minv, 0, sizeof(minv));
		memset(sumv, 0, sizeof(sumv));
		memset(setv, -1, sizeof(setv));
		memset(addv, 0, sizeof(addv));
	}
	void maintain(int o, int L, int R) {
		if (setv[o] != -1) {
			sumv[o] = (long long)setv[o] * (R - L + 1);
			maxv[o] = minv[o] = setv[o];
		}
		else if (L < R) {
			sumv[o] = sumv[o << 1] + sumv[o << 1 | 1];
			maxv[o] = max(maxv[o << 1], maxv[o << 1 | 1]);
			minv[o] = min(minv[o << 1], minv[o << 1 | 1]);
         }
		sumv[o] += (long long)addv[o] * (R - L + 1);
		maxv[o] += addv[o];
		minv[o] += addv[o];
	}
	void pushdown(int o) {//只是往下推一层，set会覆盖add必须推到底
		if (setv[o] != -1) {
			setv[o << 1] = setv[o << 1 | 1] = setv[o];
			addv[o << 1] = addv[o << 1 | 1] = 0;
			setv[o] = -1;
		}
		if (addv[o] > 0) {
			addv[o << 1] += addv[o];
			addv[o << 1 | 1] += addv[o];
			addv[o] = 0;
		}
	}
	void update(int o, int L, int R) {
		if (ql <= L && R <= qr) {
			if (op == 1) addv[o] += v;
			else { addv[o] = 0;setv[o] = v; }
		}
		else {
			pushdown(o);
			int M = (L + R) >> 1;
			if (ql <= M)update(o << 1, L, M);else maintain(o << 1, L, M);
			if (M < qr)update(o << 1 | 1, M + 1, R);else maintain(o << 1 | 1, M + 1, R);
		}
		maintain(o, L, R);
	}
	void query(int o, int L, int R, int add) {
		if (setv[o] != -1) {//set优先级最高
			long long t = setv[o] + add + addv[o];
			_sum += (long long)t*(min(R, qr) - max(L, ql) + 1);
			_max = max(_max, t);
			_min = min(_min, t);
		}
		else if (ql <= L && R <= qr) {//全包含
			_sum += sumv[o] + add * (R - L + 1);
			_max = max(_max, maxv[o] + add);
			_min = min(_min, minv[o] + add);
		}
		else{//否则递归
			int M = (L + R) >> 1;
			if (ql <= M)query(o << 1, L, M, add + addv[o]);
			if (M < qr)query(o << 1 | 1, M + 1, R, add + addv[o]);
		}
	}
}tr[21];
void init(int n) {
	for (int i = 1;i <= n;i++) {
		tr[i].init();
		tr[i].setv[1] = 0;//一开始将所有数字都设计为0
	}
}

int main()
{
	int r,c,m;
	while (~scanf("%d%d%d", &r, &c, &m)) {
		init(r);
		while (m--) {
			scanf("%d", &op);
			if (op == 1 || op == 2) {
				int x1, x2;
				scanf("%d%d%d%d%d", &x1, &ql, &x2, &qr, &v);
				for (int i = x1;i <= x2;i++) tr[i].update(1, 1, c);
			}
			else if (op == 3) {
				int x1, x2;
				_sum = 0, _max = -inf, _min = inf;
				scanf("%d%d%d%d", &x1, &ql, &x2, &qr);
				for (int i = x1;i <= x2;i++) tr[i].query(1, 1, c, 0);
				printf("%lld %lld %lld\n", _sum, _min, _max);
			}
		}
	}
	return 0;
}