hdu 1892（二维树状数组模板）

#include<cstdio>

#include <iostream>
#include <cstring>
#include <string>
using namespace std;
const int size = 1002;


int C[size][size];


int lowbit(int n)
{
    return n&(-n);
}


void Modify(int x, int y, int delta)
{
    for(int i = x; i <= 1001; i += lowbit(i))
        for(int j = y; j <= 1001; j += lowbit(j))
        {
            C[i][j] += delta;
        }
}


int Sum(int i, int j)
{
    int result = 0;
    for(int x = i; x > 0; x -= lowbit(x))
    {
        for(int y = j; y > 0; y -= lowbit(y))
        {
            result += C[x][y];
        }
    }
    return result;
}
int main()
{
    int cas,q,ca;
    char str;
    int x1,y1,x2,y2,n1;
    int xmin,ymin,xmax,ymax;
    int ans;
    scanf("%d",&cas);
    for(ca = 1;ca <=cas;ca++)
    {
        printf("Case %d:\n",ca);
        memset(C,0,sizeof(C));
        for (x1 = 1;x1 <= 1001;x1++)
            for (y1 = 1;y1 <= 1001;y1++)
            {
                Modify(x1,y1,1);
            }
        scanf("%d",&q);
        while (q--)
        {
            getchar();
            scanf("%c",&str);
            if(str == 'S')
            {
                scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
                x1++;y1++;x2++;y2++;
                xmax = max(x1,x2);
                ymax = max(y1,y2);
                xmin = min(x1,x2);
                ymin = min(y1,y2);
                int temp = Sum(xmax,ymin-1) + Sum(xmin-1,ymax) - Sum(xmin-1,ymin-1);
                ans = Sum(xmax,ymax) - temp; //这样可以防止某些越界
                printf("%d\n",ans);
            }
            else if (str == 'A')  //add
            {
                scanf("%d %d %d",&x1,&y1,&n1);
                x1++;y1++;
                Modify(x1,y1,n1);
            }
            else if (str == 'D')  //delete
            {
                scanf("%d %d %d",&x1,&y1,&n1);
                x1++;y1++;
                int sumcur=Sum(x1,y1-1) + Sum(x1-1,y1) - Sum(x1-1,y1-1);
                sumcur=Sum(x1,y1)-sumcur;
                if(sumcur < n1)
                n1 = sumcur ;
                Modify(x1,y1,-n1);
            }
            else if (str == 'M')  //move
            {
                scanf("%d %d %d %d %d",&x1,&y1,&x2,&y2,&n1);
                x1++;y1++;x2++;y2++;
                int sumcur=Sum(x1,y1-1) + Sum(x1-1,y1) - Sum(x1-1,y1-1);
                sumcur=Sum(x1,y1)-sumcur;
                if(sumcur < n1)
                n1=sumcur;
                Modify(x1,y1,-n1);
                Modify(x2,y2,n1);
            }
        }
    }
    return 0;
}