题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2642
二维树状数组的模板题,单点更新,区域求和。
代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 1005
#define lowbit(x) (x&-x)
using namespace std;
int map[maxn][maxn], c[maxn][maxn];
int m, x1, x2, y1, y2;
char s[11];
void add(int x, int y, int d)
{
for (int i=x; i<=maxn; i+=lowbit(i))
for (int j=y; j<=maxn; j+=lowbit(j))
c[i][j] += d;
}
int sum(int x, int y)
{
int Sum = 0;
for (int i=x; i>0; i-=lowbit(i))
for (int j=y; j>0; j-=lowbit(j))
Sum += c[i][j];
return Sum;
}
int main()
{
while (scanf("%d", &m)!=EOF)
{
memset(map, 0, sizeof(map));
memset(c, 0, sizeof(c));
while (m--)
{
scanf("%s", s);
if (s[0]=='B')
{
scanf("%d%d", &x1, &y1);
x1++;y1++;
if (!map[x1][y1])
{
map[x1][y1] = 1;
add(x1, y1, 1);
}
}
else if (s[0]=='D')
{
scanf("%d%d", &x1, &y1);
x1++;y1++;
if (map[x1][y1])
{
map[x1][y1] = 0;
add(x1, y1, -1);
}
}
else
{
scanf("%d%d%d%d", &x1, &x2, &y1, &y2);
x1++;x2++;y1++;y2++;
if (x1>x2)
swap(x1, x2);
if (y1>y2)
swap(y1, y2);
int Sum = sum(x2, y2)-sum(x2, y1-1)-sum(x1-1, y2)+sum(x1-1, y1-1);
printf("%d\n", Sum);
}
}
}
return 0;
}