1452: [JSOI2009]Count 二维树状数组

Description

Input

Output

Sample Input

Sample Output

       1

       2

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxm = 305;
int f[maxm][maxm][105], a[maxm][maxm], n, m;
int lowbit(int k);
void update(int x, int y, int val, int v);
int query(int x, int y, int k);
int main()
{
	int  i, j, k, sum, q, x1, y1, x2, y2, z, ord;
	scanf("%d%d", &n, &m);
	for (i = 1;i <= n;i++)
	{
		for (j = 1;j <= m;j++)
		{
			scanf("%d", &a[i][j]);
			update(i, j, a[i][j], 1);
		}
	}
	scanf("%d", &q);
	while (q--)
	{
		scanf("%d", &ord);
		if (ord == 1)
		{
			scanf("%d%d%d", &x1, &y1, &z);
			update(x1, y1, a[x1][y1], -1);
			update(x1, y1, z, 1);
			a[x1][y1] = z;
		}
		else
		{
			scanf("%d%d%d%d%d", &x1, &x2, &y1, &y2, &z);
			printf("%d\n", query(x2, y2, z) - query(x2, y1 - 1,z) - query(x1 - 1, y2,z) + query(x1 - 1, y1 - 1, z));
		}
	}
	return 0;
}
int lowbit(int k)
{
	return k&(-k);
}
void update(int x, int y, int val, int v)
{
	for (int i = x;i <= n;i += lowbit(i))
	{
		for (int j = y;j <= m;j += lowbit(j))
			f[i][j][val] += v;
	}
}
int query(int x, int y, int k)
{
	int ans = 0;
	for (int i = x;i >= 1;i -= lowbit(i))
	{
		for (int j = y;j >= 1;j -= lowbit(j))
			ans += f[i][j][k];
	}
	return ans;
}