BZOJ1452 count （树状数组）

一道比较水的二维树状数组，开100个即可，只有100种颜色还是比较EZ的。

 Program BZOJ1452;
 const maxn=;
       maxc=;
 var a:array[..maxn,..maxn,..maxc] of longint;
     f:array[..maxn,..maxn] of longint;
     m,n,i,j,x,y,x1,y1,x2,y2,z,Q,ch,sum:longint;
 procedure add(i,j,c,k:longint);
 var x,y:longint;
 begin
     x:=i;
     while x<=m do
     begin
         y:=j;
         while y<=n do
         begin
             inc(a[x,y,c],k);
             y:=y+y and -y;
         end;
         x:=x+x and -x;
     end;
 end;
 function sigma(i,j,c:longint):longint;
 var x,y,sum:longint;
 begin
     sum:=;    x:=i;
     while x> do
     begin
         y:=j;
         while y> do
         begin
             inc(sum,a[x,y,c]);
             y:=y-y and -y;
         end;
         x:=x-x and -x;
     end;
     exit(sum);
 end;
 begin
     readln(m,n);
     for i:= to m do
         for j:= to n do
         begin
             read(x);
             add(i,j,x,);
             f[i,j]:=x;
         end;
     readln(Q);
     while Q> do
     begin
         read(ch);
         if ch= then
         begin
             readln(x,y,z);
             add(x,y,f[x,y],-);
             f[x,y]:=z;
             add(x,y,z,);
         end else
         begin
             readln(x1,x2,y1,y2,z);
             sum:=sigma(x2,y2,z)-sigma(x1-,y2,z)-sigma(x2,y1-,z)+sigma(x1-,y1-,z);
             writeln(sum);
         end;
         dec(Q);
     end;
 end.