线段树模板

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
struct node{
   int l, r, addv, setv, maxv, minv, sum;
}e[maxn * 4];
void bulid(int a, int b, int c){
   e[c].l = a, e[c].r = b;
   e[c].addv = e[c].setv = e[c].minv = e[c].maxv = e[c].sum = 0;
   if(a==b) return;
   int mid = (a+b)/2;
   bulid(a, mid, c*2);
   bulid(mid+1, b, c*2+1);
}
void pushdown(int c){
     int l = 2*c, r = 2*c+1;
   if(e[c].setv){
      e[l].addv = e[r].addv = 0;
      e[l].setv = e[r].setv = e[c].setv;
      e[l].minv = e[r].minv = e[c].setv;
      e[l].maxv = e[r].maxv = e[c].setv;
      e[l].sum  = (e[l].r - e[l].l + 1) * e[c].setv;
      e[r].sum  = (e[r].r - e[r].l + 1) * e[c].setv;
      e[c].setv = 0;
   }
   if(e[c].addv){
      e[l].addv += e[c].addv; e[r].addv += e[c].addv;
      e[l].maxv += e[c].addv; e[r].maxv += e[c].addv;
      e[l].minv += e[c].addv; e[r].minv += e[c].addv;
      e[l].sum += (e[l].r - e[l].l + 1) * e[c].addv;
      e[r].sum += (e[r].r - e[r].l + 1) * e[c].addv;
      e[c].addv = 0;
   }

}
void add(int a, int b, int c, int val){
   if(e[c].l == a && e[c].r == b){
    e[c].addv += val;
    e[c].maxv += val;
    e[c].minv += val;
    e[c].sum += (b-a+1)*val;
    return;
   }
   int mid = (e[c].l + e[c].r) / 2;
   pushdown(c);
   if(b <= mid) add(a, b, 2*c, val);
   else if(a > mid) add(a, b, 2*c+1, val);
   else{
       add(a, mid, 2*c, val);
       add(mid+1, b, 2*c+1, val);
   }
   e[c].maxv = max(e[c*2].maxv, e[c*2+1].maxv);
   e[c].minv = min(e[c*2].minv, e[c*2+1].minv);
   e[c].sum = e[2*c].sum + e[2*c+1].sum;

}
void update(int a, int b, int c, int val){
   if(e[c].l == a && e[c].r == b){
    e[c].addv = 0;
    e[c].setv = val;
    e[c].maxv = val;
    e[c].minv = val;
    e[c].sum = (b-a+1)*val;
    return;
   }
   pushdown(c);
   int mid = (e[c].l + e[c].r) / 2;
   if(b <= mid) update(a, b, 2*c, val);
   else if(a > mid) update(a, b, 2*c+1, val);
   else{
    update(a, mid, 2*c, val);
    update(mid+1, b, 2*c+1, val);
   }
   e[c].maxv = max(e[c*2].maxv, e[c*2+1].maxv);
   e[c].minv = min(e[c*2].minv, e[c*2+1].minv);
   e[c].sum = e[2*c].sum + e[2*c+1].sum;
}
node query(int a, int b, int c){
   if(e[c].l == a && e[c].r == b) return e[c];
   pushdown(c);
   int mid = (e[c].l + e[c].r) / 2;
   if(b <= mid) return query(a, b, 2*c);
   else if(a > mid) return query(a, b, 2*c+1);
   else{
    node o, p, q;
    p = query(a, mid, 2*c);
    q = query(mid + 1, b, 2*c+1);
    o.sum = p.sum + q.sum;
    o.maxv = max(p.maxv, q.maxv);
    o.minv = min(p.minv, q.minv);
    return o;
   }

}
int main()
{
    ios::sync_with_stdio(false);
    int r, c, m;
    while(cin >> r >> c >> m){
    int i, j, k ,a, x1, y1, x2, y2, val;
    bulid(1, r * c, 1);
    for(i = 0; i < m; i++){
        cin >> a;
        if(a==1){
            cin >> x1 >> y1 >> x2 >> y2 >> val;
            for(j = x1; j <= x2; j++)
                add((j-1)*c+y1, (j-1)*c+y2, 1, val);
        } else if(a==2){
            cin >> x1 >> y1 >> x2 >> y2 >> val;
            for(j = x1; j <= x2; j++)
                update((j-1)*c+y1, (j-1)*c+y2, 1, val);
        }else{
            node ans, p;
            cin >> x1 >> y1 >> x2 >> y2;
            for(j = x1; j <= x2; j++){
                if(j==x1) ans = query((j-1)*c+y1, (j-1)*c+y2, 1);
                else{
                    p = query((j-1)*c+y1, (j-1)*c+y2, 1);
                    ans.sum += p.sum;
                    ans.maxv = max(ans.maxv, p.maxv);
                    ans.minv = min(ans.minv, p.minv);
                }

            }
            cout << ans.sum << " " << ans.minv << " " << ans.maxv << endl;

        }


    }
    }
}