BZOJ1452 count （树状数组）

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

Program BZOJ1452;
const maxn=308;
      maxc=108;
var a:array[0..maxn,0..maxn,0..maxc] of longint;
    f:array[0..maxn,0..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:=0;    x:=i;
    while x>0 do
    begin
        y:=j;
        while y>0 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:=1 to m do
        for j:=1 to n do
        begin
            read(x);
            add(i,j,x,1);
            f[i,j]:=x;
        end;
    readln(Q);
    while Q>0 do
    begin
        read(ch);
        if ch=1 then
        begin
            readln(x,y,z);
            add(x,y,f[x,y],-1);
            f[x,y]:=z;
            add(x,y,z,1);        
        end else
        begin
            readln(x1,x2,y1,y2,z);
            sum:=sigma(x2,y2,z)-sigma(x1-1,y2,z)-sigma(x2,y1-1,z)+sigma(x1-1,y1-1,z);        
            writeln(sum);
        end;
        dec(Q);
    end;
end.