二维树状数组poj1195

单点更新，区间查询

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<utility>
using namespace std;
int a[2000][2000];
int n;
int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int y,int d)
{
	for (int i=x;i<=n;i+=lowbit(i))
		for (int j=y;j<=n;j+=lowbit(j))a[i][j]+=d;	
}
int sum(int x,int y)
{
	int ans=0;
	for (int i=x;i>0;i-=lowbit(i))
		for (int j=y;j>0;j-=lowbit(j)) ans+=a[i][j];
	return ans;	
}
int main()
{
	int ok;
	while (scanf("%d",&ok)!=EOF)
	{
		scanf("%d",&n);
		memset(a,0,sizeof(a));
		int x,y,xx,yy,k;
		while (scanf("%d",&k)&&k!=3)
		{
			if (k==1)
			{
				scanf("%d%d%d",&x,&y,&xx);
				add(x+1,y+1,xx);
			}
			else 
			{
				scanf("%d%d%d%d",&x,&y,&xx,&yy);
				printf("%d\n",sum(xx+1,yy+1)-sum(xx+1,y-1+1)-sum(x-1+1,yy+1)+sum(x-1+1,y-1+1));
			}
			
		}
	}
	return 0;
}