Bzoj1452 Count

http://www.lydsy.com/JudgeOnline/problem.php?id=1452

题目全是图片，不复制了。

开100个二维树状数组，分别记录区间内各个颜色的出现位置……

简单粗暴。

注意查询操作的读入顺序是x1 x2 y1 y2

 /*by SilverN*/
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 const int mxn=;
 int t[][mxn][mxn];
 int c[mxn][mxn];
 int n,m;
 inline int lowbit(int x){return x&-x;}
 void add(int x,int y,int c,int v){
     while(x<=n){
         int tmp=y;
         while(tmp<=m){t[c][x][tmp]+=v;tmp+=lowbit(tmp);}
         x+=lowbit(x);
     }
 }
 int smm(int x,int y,int c){
     int res=;
     while(x){
         int tmp=y;
         while(tmp){res+=t[c][x][tmp];tmp-=lowbit(tmp);}
         x-=lowbit(x);
     }
     return res;
 }
 int ask(int x1,int y1,int x2,int y2,int c){
     return smm(x2,y2,c)+smm(x1-,y1-,c)-smm(x2,y1-,c)-smm(x1-,y2,c);
 }
 int main(){
     int i,j;int x;
     scanf("%d%d",&n,&m);
     for(i=;i<=n;i++)
         for(j=;j<=m;j++){
             scanf("%d",&x);
             c[i][j]=x;
             add(i,j,x,);
         }
     int Q;
     scanf("%d",&Q);
     int x1,y1,x2,y2;
     while(Q--){
         scanf("%d",&i);
         if(i==){
             scanf("%d%d%d",&x1,&y1,&x);
             add(x1,y1,c[x1][y1],-);
             c[x1][y1]=x;
             add(x1,y1,c[x1][y1],);
         }
         else{
             scanf("%d%d%d%d%d",&x1,&x2,&y1,&y2,&x);
             printf("%d\n",ask(x1,y1,x2,y2,x));
         }
     }
     return ;
 }