SPOJ-1029-二维树状数组

题解思路：就是个纯二维树状数组

代码：

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<iostream>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int mx = 1e3+100;
int n,m,matr[mx][mx],num[mx][mx];
char str[10];
struct data{
	int maxx,minn;
	data(){}
	data(int Ma,int Mi){ maxx = Ma, minn = Mi ; }
};
inline int lowbit(int x){
	return x&(-x);
}
void update(int x,int y,int val){
	for(int i=x;i<=n;i+=lowbit(i))
	for(int j=y;j<=n;j+=lowbit(j))
	matr[i][j]+=val;
}
ll getsum(int x,int y){
	ll ans = 0;
	for(int i=x;i>0;i-=lowbit(i))
	for(int j=y;j>0;j-=lowbit(j))
	ans+=matr[i][j];
	return ans;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		num[i][j] = matr[i][j] = 0;
		while(scanf("%s",str)&&str[0]!='E'){
			int x,y,z,q;
			if(str[1]=='E'){
				scanf("%d%d%d",&x,&y,&z);
				x++, y++;
				update(x,y,z-num[x][y]);
				num[x][y] = z;
			}else{
				scanf("%d%d%d%d",&x,&y,&z,&q);
				x++, y++, z++, q++; 
				ll ans = getsum(z,q);
				ans -= getsum(x-1,q)+getsum(z,y-1);
				ans += getsum(x-1,y-1);
				printf("%lld\n",ans);
			}
		}
	}
	return 0;
}