二维树状状数(专题学习)

二维树状数组，顾明思义，其实就是树状数组的二维形式。
主要运用:
1.单点更新
2.子矩阵求和
其中getSum求的是矩阵从(1,1)到(x,y)这个矩阵的和，如果我们需要求某个子矩阵的和,那么
res=getSum(x2,y2)+getSum(x1-1,y1-1)-getSum(x2,y1-1)-getSum(x1-1,y2)
注意矩阵的赋值是数组从1开始的，由于他是二维的树状数组，和一维的差不多。

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#include<limits.h>
#define fir first
#define sec second
#define fin freopen("/home/ostreambaba/文档/input.txt", "r", stdin)
#define fout freopen("/home/ostreambaba/文档/output.txt", "w", stdout)
#define mes(x, m) memset(x, m, sizeof(x))
#define pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 1e9+7
#define Pi 4.0*atan(1.0)
#define MOD 1000000007

#define lowbit(x) (x&(-x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ls rt<<1
#define rs rt<<1|1

typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-12;
const int maxn = 4;
using namespace std;

inline int read(){
    int x(0),f(1);
    char ch=getchar();
    while(ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int N;
ll mat[maxn][maxn];
inline void update(int x,int y,int cnt)
{
    for(int i=x; i<=N; i+=lowbit(i)){
        for(int j=y; j<=N; j+=lowbit(j)){
            mat[i][j]+=cnt;
        }
    }
}
inline ll getSum(int x,int y)
{
    ll res=0;
    for(int i=x; i>0; i-=lowbit(i)){
        for(int j=y; j>0; j-=lowbit(j)){
            res+=mat[i][j];
        }
    }
    return res;
}
int main()
{
    mes(mat, 0);
    N = read();
    ll num;
    for(int i=1; i<=N; ++i){
        for(int j=1; j<=N; ++j){
            scanf("%lld", &num);
            update(i,j,num);
        }
    }
    int Q;
    Q=read();
    while(Q--){
        int x1,y1,x2,y2;
        x1=read();
        y1=read();
        x2=read();
        y2=read();
        ll res=getSum(x2,y2)+getSum(x1-1,y1-1)-getSum(x2,y1-1)-getSum(x1-1,y2);
        /*int x,y;
        x=read();
        y=read();
        ll res=getSum(x,y);*/
        cout<<res<<endl;
    }
}