二维树状数组

1、单点修改，区间查询

例题：https://loj.ac/problem/133

分析：类比一维的单点修改，区间查询

Ac code:

#include<bits/stdc++.h>
using namespace std;
const int maxn=5100;
typedef long long ll;
ll c[maxn][maxn];
int n,m;
int lowbit(int x)
{
    return x&(-x);
}
void update(int x,int y,ll val)
{
    for(int i=x;i<=n;i+=lowbit(i))
        for(int j=y;j<=m;j+=lowbit(j))
          c[i][j]+=val;
}
ll getsum(int x,int y)
{
    ll ans=0;
    for(int i=x;i>0;i-=lowbit(i))
        for(int j=y;j>0;j-=lowbit(j))
          ans+=c[i][j];
    return ans;
}
int main()
{
    scanf("%d%d",&n,&m);
    int op,x1,x2,y1,y2;
    while(scanf("%d%d%d%d",&op,&x1,&y1,&x2)!=EOF){
        if(op==1){
            update(x1,y1,x2);
        }
        else{
            scanf("%d",&y2);
            printf("%lld\n",getsum(x2,y2)-getsum(x1-1,y2)-getsum(x2,y1-1)+getsum(x1-1,y1-1));
        }
    }
    return 0;
}

2、区间修改，区间查询

例题：https://loj.ac/problem/135

分析：看图

Ac code:

#include<bits/stdc++.h>
using namespace std;
const int maxn=2050;
typedef long long ll;
ll c1[maxn][maxn],c2[maxn][maxn],c3[maxn][maxn],c4[maxn][maxn];
int n,m;
int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int y,ll val)
{
    for(int i=x;i<=n;i+=lowbit(i))
        for(int j=y;j<=m;j+=lowbit(j))
          {
              c1[i][j]+=val;
              c2[i][j]+=x*val;
              c3[i][j]+=y*val;
              c4[i][j]+=x*y*val;
          }
}
void update(int x1,int y1,int x2,int y2,ll val)
{
    add(x1,y1,val);
    add(x2+1,y1,-val);
    add(x1,y2+1,-val);
    add(x2+1,y2+1,val);
}
ll getsum(int x,int y)
{
    ll ans=0;
    for(int i=x;i>0;i-=lowbit(i))
        for(int j=y;j>0;j-=lowbit(j))
          {
              ans+=(x+1)*(y+1)*c1[i][j]-(y+1)*c2[i][j]-(x+1)*c3[i][j]+c4[i][j];
          }
    return ans;
}
int main()
{
    scanf("%d%d",&n,&m);
    int op,x1,x2,y1,y2,k;
    while(scanf("%d%d%d%d%d",&op,&x1,&y1,&x2,&y2)!=EOF){
        if(op==1){
            scanf("%d",&k);
            update(x1,y1,x2,y2,k);
        }
        else{
            printf("%lld\n",getsum(x2,y2)-getsum(x1-1,y2)-getsum(x2,y1-1)+getsum(x1-1,y1-1));
        }
    }
    return 0;
}