二维树状数组

POJ 1195 Mobile phones

裸的二维树状数组，贴个模板~

#include<map>
#include<set>
#include<list>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cctype>
#include<cstdio>
#include<string>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<utility>    //pair
#include<iostream>
#include<algorithm>
#define MAXN 1105
#define INF 0x3f3f3f3f
#define LL long long
#define DBL double
#define EPS 1e-6
#define PI acos(-1.0)
#define Test() cout<<"Test"<<endl;
#define Debug(a) cout<<#a<<" = "<<a<<endl;
#define Debug2(a,b) cout<<#a<<" = "<<a<<" , "<<#b<<" = "<<b<<endl;
using namespace std;

int cmd, n;
int c[MAXN][MAXN];

int lowbit(int x){
    return x&(-x);
}
void add(int x, int y, int val){
    for(int i=x; i<=n; i+=lowbit(i))
      for(int j=y; j<=n; j+=lowbit(j))
         c[i][j]+=val;
}
int sum(int x, int y){
    //if(x<=0||y<=0) return 0;
    int s=0;
    for(int i=x; i>0; i-=lowbit(i))
      for(int j=y; j>0; j-=lowbit(j))
         s+=c[i][j];
    return s;
}

int main()                //2维树状数组
{
    cin>>cmd;
    while(cmd!=3){
        if(cmd == 0){
            cin>>n>>cmd;
            memset(c, 0, sizeof(c));    //init~~
            continue;
        }
        while(cmd!=3){
            if(cmd==1){
                int x, y, a;
                scanf("%d%d%d", &x, &y, &a);
                x++, y++;
                add(x, y, a);
            }else{
                int l, b, r, t;
                scanf("%d%d%d%d", &l, &b, &r, &t);
                l++, b++, r++, t++;
                printf("%d
", sum(r, t)+sum(l-1, b-1)-sum(r, b-1)-sum(l-1, t));
            }
            scanf("%d", &cmd);
        }
    }
    return 0;
}