二维树状数组的单点修改和区间查询（板子）libreoj133

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m;
ll a[5010][5010];
ll lowbit(ll x){
    return (x&-x);
}
void add(ll x,ll y,ll k){
    for(ll i=x;i<=n;i+=lowbit(i)){
        for(ll j=y;j<=m;j+=lowbit(j)){
            a[i][j]+=k;
        }
    }
}
ll getsum(ll x,ll y){
    ll sum=0;
    for(ll i=x;i>0;i-=lowbit(i)){
        for(ll j=y;j>0;j-=lowbit(j)){
            sum+=a[i][j];
        }
    }
    return sum;
}
int main(){
    scanf("%lld%lld",&n,&m);
    ll type;
    while(scanf("%lld",&type)!=EOF){
        if(type==1){
            ll x,y,k;
            scanf("%lld%lld%lld",&x,&y,&k);
            add(x,y,k);
        }
        if(type==2){
            ll x1,y1,x2,y2;
            scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
            printf("%lld\n",getsum(x2,y2)-getsum(x2,y1-1)-getsum(x1-1,y2)+getsum(x1-1,y1-1));
        }
    }
    return 0;}