算法模板——线段树1（区间加法+区间求和）

实现功能——1：区间加法；2：区间求和

最基础最经典的线段树模板。由于这里面操作无顺序之分，所以不需要向下pushup，直接累积即可

var
   i,j,k,l,m,n,a1,a2,a3,a4:longint;
   a,b:array[0..100000] of longint;
function max(x,y:longint):longint;inline;
         begin
              if x>y then max:=x else max:=y;
         end;
function min(X,Y:LOngint):longint;inline;
         begin
              if x<y then min:=x else min:=y;
         end;
procedure built(z,x,y:longint);inline;
          begin
               if x=y then
                  read(a[z])
               else
                   begin
                        built(z*2,x,(x+y) div 2);
                        built(z*2+1,(x+y) div 2+1,y);
                        a[z]:=a[z*2]+a[z*2+1];
                   end;
               b[z]:=0;
          end;
function op(z,x,y,l,r,d:longint):longint;inline;
         var a3,a4:longint;
         begin
              if l>r then exit(0);
              if (x=l) and (r=y) then
                 begin
                      b[z]:=b[z]+d;
                      exit(d*(r-l+1));
                 end;
              a3:=op(z*2,x,(x+y) div 2,l,min(r,(x+y) div 2),d);
              a4:=op(z*2+1,(x+y) div 2+1,y,max((x+y) div 2+1,l),r,d);
              a[z]:=a[z]+a3+a4;
              exit(a3+a4);
         end;
function cal(z,x,y,l,r,d:longint):longint;inline;
         begin
              if l>r then exit(0);d:=d+b[z];
              if (x=l) and (y=r) then exit(a[z]+d*(r-l+1));
              exit(cal(z*2,x,(x+y) div 2,l,min(r,(x+y) div 2),d)+cal(z*2+1,(x+y) div 2+1,y,max(l,(x+y) div 2+1),r,d));
         end;
begin
     readln(n,m);
     built(1,1,n);
     readln;
     for i:=1 to m do
         begin
              read(j);
              case j of
                   1:begin
                          readln(a1,a2,a3);
                          op(1,1,n,a1,a2,a3);
                   end;
                   2:begin
                          readln(a1,a2);
                          writeln(cal(1,1,n,a1,a2,0));
                   end;
                   else halt;
              end;
         end;
end.