bzoj 1452: [JSOI2009]Count （二维树状数组）

链接：https://www.lydsy.com/JudgeOnline/problem.php?id=1452

思路： 对每个颜色开一个二维树状数组维护就好了

实现代码：

#include<bits/stdc++.h>
using namespace std;
int bit[][][];
int a[][],n,m,q;
int lowbit(int x){
    return x&-x;
}

void add(int x,int y,int z,int rt){
    for(int i = x;i <= n;i += lowbit(i)){
        for(int j = y;j <= m;j += lowbit(j)){
            bit[rt][i][j] += z;
        }
    }
}

int getsum(int x,int y,int rt){
    int res = ;
    for(int i = x;i;i -= lowbit(i)){
        for(int j = y;j;j -= lowbit(j)){
            res += bit[rt][i][j];
        }
    }
    return res;
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i = ;i <= n;i ++){
        for(int j = ;j <= m;j ++){
            scanf("%d",&a[i][j]);
            add(i,j,,a[i][j]);
        }
    }
    int op,x,y,z,x1,x2,y1,y2;
    scanf("%d",&q);
    while(q--){
        scanf("%d",&op);
        if(op == ){
            scanf("%d%d%d",&x,&y,&z);
            add(x,y,-,a[x][y]);
            add(x,y,,z);
            a[x][y] = z;
        }
        else{
            scanf("%d%d%d%d%d",&x1,&x2,&y1,&y2,&z);
            int num = getsum(x2,y2,z) - getsum(x1-,y2,z) - getsum(x2,y1-,z) + getsum(x1-,y1-,z);
            printf("%d\n",num);
        }
    }
    return ;
}