改变矩形内颜色
#include <cstdio> //二维树状数组
#include <cstring>
using namespace std;
#define maxn 200
int flag[maxn][maxn],col[maxn][maxn];
int lowbit(int x)
{
return x&-x;
}
void update(int x,int y,int n)
{
if(flag[x][y]==n) return ; //状态判定
flag[x][y]=n;
int i,j;
for(i=x;i<maxn;i+=lowbit(i))
for(j=y;j<maxn;j+=lowbit(j))
col[i][j]+=n;
}
int getsum(int x,int y)
{
int i,j,sum;
sum=0;
for(i=x;i>0;i-=lowbit(i))
for(j=y;j>0;j-=lowbit(j))
sum+=col[i][j];
return sum;
}
int main()
{
char str[10];
int i,j,k,x,y,l,n;
while(scanf("%d",&n)!=EOF)
{
memset(flag,-1,sizeof(flag));
memset(col,0,sizeof(col));
for(k=1;k<=n;k++)
{
scanf("%s%d%d%d",&str,&x,&y,&l);
if(str[0]=='B')
{
for(i=x;i<=x+l-1;i++)
for(j=y;j<=y+l-1;j++)
update(i,j,1);
}
else if(str[0]=='W')
{
for(i=x;i<=x+l-1;i++)
for(j=y;j<=y+l-1;j++)
update(i,j,-1);
}
else
printf("%d\n",getsum(x+l-1,y+l-1)-getsum(x+l-1,y-1)-getsum(x-1,y+l-1)+getsum(x-1,y-1));
}
}
return 0;
}