hdu1892See you~

二维树状数组，就是一维树状数组的推广。今晚BC想用树状数组解决第三题，可是不行，TLE。需要多做题巩固，现在还是半懂不懂状态。。。但是推广的时候思想是对的。

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define LL long long
const int maxn =  1010;
using namespace std;
int b[maxn][maxn],n,T,book[maxn][maxn],x1,x2,y1,y2,n1;
int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int y,int dd)
{
    for(int i=x; i< maxn; i+=lowbit(i))
    {
        for(int j=y; j< maxn; j+=lowbit(j))
        {
            b[i][j]+=dd;
        }
    }
}
int sum(int i,int j)
{
    int sum=0;
    for(int x=i; x>0; x-=lowbit(x))
    {
        for(int y=j; y>0; y-=lowbit(y))
        {
            sum+=b[x][y];
        }
    }
    return sum;
}
int main()
{
    scanf("%d",&T);
    int kas = 1;
    while(T--)
    {
        memset(b,0,sizeof(b));
        memset(book,0,sizeof(book));
        for(int i=1; i< maxn; i++)
            for(int j=1; j< maxn; j++)
            {
                book[i][j]=1;
                add(i,j,1);
            }
        printf("Case %d:\n",kas++);
        scanf("%d",&n);

        for(int i=1; i<=n; i++)
        {
            getchar();
            char a;
            scanf("%c",&a);
            if(a=='S')
            {
                scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
                x1++;
                x2++;
                y1++;
                y2++;
                if(x1>x2)
                    swap(x1,x2);
                if(y1>y2)
                    swap(y1,y2);
                printf("%d\n",sum(x2,y2)+sum(x1-1,y1-1)-sum(x2,y1-1)-sum(x1-1,y2));
            }
            else if(a=='A')
            {
                scanf("%d %d %d",&x1,&y1,&n1);
                x1++;
                y1++;
                add(x1,y1,n1);
                book[x1][y1]+=n1;
            }
            else if(a=='D')
            {
                scanf("%d %d %d",&x1,&y1,&n1);
                x1++;
                y1++;
                if(book[x1][y1]<n1)
                {
                    add(x1,y1,-book[x1][y1]);
                    book[x1][y1]=0;
                }
                else
                {
                    add(x1,y1,-n1);
                    book[x1][y1]-=n1;
                }
            }
            else if(a=='M')
            {
                scanf("%d %d %d %d %d",&x1,&y1,&x2,&y2,&n1);
                x1++;
                y1++;
                x2++;
                y2++;
                if(book[x1][y1]<n1)
                {
                    add(x1,y1,-book[x1][y1]);
                    add(x2,y2,book[x1][y1]);
                    book[x2][y2]+=book[x1][y1];
                    book[x1][y1]=0;
                }
                else
                {
                    book[x1][y1]-=n1;
                    book[x2][y2]+=n1;
                    add(x1,y1,-n1);
                    add(x2,y2,n1);
                }
            }
        }
    }
    return 0;
}