2019.9.4 二维树状数组

#include<iostream>
#include<cstdio>
#include<cstring>
#define int long long
#define lowbit(x) x&(-x)
using namespace std;
int c[5005][5005],n,m,x,y,k,a,b,cc,d,t;
void updata(int p,int q,int x)
{
    for(int i=p;i<=n;i+=lowbit(i))
    {
        for(int j=q;j<=m;j+=lowbit(j))
        {
            c[i][j]+=x;
        }
    }
}
int query(int p,int q)
{
    int res=0;
    for(int i=p;i>=1;i-=lowbit(i))
    {
        for(int j=q;j>=1;j-=lowbit(j))
        {
            res+=c[i][j];
        }
    }
    return res;
}
signed main()
{
    scanf("%lld%lld",&n,&m);
    while(scanf("%lld",&t)!=EOF)
    {
        if(t==1)
        {
            scanf("%lld%lld%lld",&x,&y,&k);
            updata(x,y,k);
        }
        else
        {
            scanf("%lld%lld%lld%lld",&a,&b,&cc,&d);
            printf("%lld\n",query(cc,d)+query(a-1,b-1)-query(cc,b-1)-query(a-1,d));
        }
    }
    return 0;
}