二维树状数组

int a[2000][2000],n;
int lowbit(int x)
{
	return x&(-x);
}
void change(int x,int y,int c)
{
	while(x<=n)
	{
		int t=y;
		while(t<=n)
		{
			a[x][t]+=c;
			t+=lowbit(t);
		}
		x+=lowbit(x);
	}
}
int query(int x,int y)
{
	int ans=0;
	while(x)
	{
		int t=y;
		while(t)
		{
			ans+=a[x][t];
			t-=lowbit(t);
		}
		x-=lowbit(x);
	}
	return ans;
}