PKU 1195 二维树状数组

题目大意：给定n*n矩阵，和几种在线操作，包括对某一点(x,y)值修改，查询一个矩形(l, b, r, t)的元素和。

二维的树状数组，直接把Update()和Getsum()改为二维即可

#include <iostream>
using namespace std;

const int maxn = 1100;
int tree[maxn][maxn];

int Lowbit(int x)  
{  
	return x & (-x);  
}  
void Update(int x, int y, int d)  
{  //注意：当i = 0，0 + Lowbit(0) = 0，会造成死循环!
	int i, j;
	for(i = x; i < maxn; i += Lowbit(i)) // 注意这里是maxn，是tree[]的大小.
	{ 
		for(j = y; j < maxn; j += Lowbit(j))
		{
			tree[i][j] += d;
		}
	}
}  
int Getsum(int x, int y)  
{  
	int sum = 0;  
	int i, j;
	for( i = x; i > 0; i -= Lowbit(i) )  
	{  
		for(j = y; j > 0; j -= Lowbit(j))
		{
			sum += tree[i][j];
		}    
	}  
	return sum;  
}  

int main()
{
	int ins;
	int n;
	int x, y, d;
	int l, b, r, t;
	while(scanf("%d", &ins), ins != 3)
	{
		if(ins == 1)
		{
			scanf("%d%d%d", &x, &y, &d);
			x++, y++;
			Update(x, y, d);
		}
		else if(ins == 2)
		{
			scanf("%d%d%d%d", &l, &b, &r, &t);
			int sum = 0;
			l++, b++, r++, t++; //防止出现死循环
			sum = Getsum(r, t) - Getsum(l-1, t) -Getsum(r, b-1) + Getsum(l-1, b-1);
			printf("%d\n", sum);
		}
		else if (ins == 0)
		{
			scanf("%d", &n);
			memset(tree, 0, sizeof(tree));
		}
	}
	return 0;
}