UVa 11992 (线段树 区间修改) Fast Matrix Operations

比较综合的一道题目。

二维的线段树，支持区间的add和set操作，然后询问子矩阵的sum，min，max

写完这道题也是醉醉哒，代码仓库里还有一份代码就是在query的过程中也pushdown向下传递标记。

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;

 const int maxnode =  << ;
 int _sum, _min, _max, op, x1, x2, y1, y2, x, v;

 struct IntervalTree
 {
     int maxv[maxnode], minv[maxnode], sumv[maxnode], setv[maxnode], addv[maxnode];

     void maintain(int o, int L, int R)
     {
         int lc = o*, rc = o*+;
         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] >= ) { maxv[o] = minv[o] = setv[o]; sumv[o] = (R-L+)*setv[o]; }
         if(addv[o]) { minv[o] += addv[o]; maxv[o] += addv[o]; sumv[o] += (R-L+)*addv[o]; }
     }

     void pushdown(int o)
     {
         int lc = o*, rc = o*+;
         if(setv[o] >= )
         {
             setv[lc] = setv[rc] = setv[o];
             addv[lc] = addv[rc] = ;
             setv[o] = -;
         }
         if(addv[o])
         {
             addv[lc] += addv[o];
             addv[rc] += addv[o];
             addv[o] = ;
         }
     }

     void update(int o, int L, int R)
     {
         int lc = o*, rc = o*+;
         if(y1 <= L && R <= y2)
         {
             if(op == ) addv[o] += v;
             else { setv[o] = v; addv[o] = ; }
         }
         else
         {
             pushdown(o);    //往下传递标记
             int M = (L + R) / ;
             if(y1 <= M) update(lc, L, M); else maintain(lc, L, M);
             if(y2 > M) update(rc, M+, R); else maintain(rc, M+, R);
         }
         maintain(o, L, R);
     }

     void query(int o, int L, int R, int add)
     {
         if(setv[o] >= )
         {
             int v = setv[o] + addv[o] + add;
             _sum += v * (min(y2, R) - max(y1, L) + );
             _min = min(_min, v);
             _max = max(_max, v);
         }
         else if(y1 <= L && R <= y2)
         {
             _sum += sumv[o] + add*(R-L+);
             _min = min(_min, minv[o] + add);
             _max = max(_max, maxv[o] + add);
         }
         else
         {
             int M = (L + R) / ;
             if(y1 <= M) query(o*, L, M, add + addv[o]);
             if(y2 > M) query(o*+, M+, R, add + addv[o]);
         }
     }
 };

 const int maxr =  + ;
 const int INF = ;

 IntervalTree tree[maxr];

 int main()
 {
     //freopen("in.txt", "r", stdin);

     int r, c, m;
     while(scanf("%d%d%d", &r, &c, &m) == )
     {
         memset(tree, , sizeof(tree));
         for(int x = ; x <= r; x++)
         {
             memset(tree[x].setv, -, sizeof(tree[x].setv));
             tree[x].setv[] = ;
         }

         while(m--)
         {
             scanf("%d%d%d%d%d", &op, &x1, &y1, &x2, &y2);
             if(op < )
             {
                 scanf("%d", &v);
                 for(x = x1; x <= x2; x++) tree[x].update(, , c);
             }
             else
             {
                 _sum = ; _max = -INF; _min = INF;
                 for(x = x1; x <= x2; x++) tree[x].query(, , c, );
                 printf("%d %d %d\n", _sum, _min, _max);
             }
         }
     }

     return ;
 }

代码君