poj 1195

题目

一道二维树状数组的裸题。

把更新，求和函数改成二维即可

求和的时候注意要

getsum(x2,y2)-getsum(x1-1,y2)-getsum(x2,y1-1)+getsum(x1-1,y1-1)

画图即可理解。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn= 1050;

int a[maxn][maxn];
int n;

int Lowbit(int x)
{
    return x&(-x);
}

void update(int x,int y,int val)
{
    int i,j;
    for(i=x;i<maxn;i+=Lowbit(i)){
        for(j=y;j<maxn;j+=Lowbit(j)){
            a[i][j]+=val;
        }
    }
}

long long getSum(int x,int y)
{
    int i,j;
    long long ans=0;
    for(i=x;i>0;i-=Lowbit(i)){
        for(j=y;j>0;j-=Lowbit(j)){
            ans+=a[i][j];
        }
    }
    return ans;
}

int main()
{
    int x1,y1,x2,y2;
    int op;
    while(scanf("%d",&op)){
        if(op==0){
            scanf("%d",&n);
            memset(a,0,sizeof(a));
            continue;
        }
        else if(op==1){
              scanf("%d %d %d",&x1,&y1,&x2);
              x1++;y1++;
              update(x1,y1,x2);
        }
        else if(op==2){
                  scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                  x1++,x2++,y1++,y2++;
                  printf("%lld\n",getSum(x2,y2)+getSum(x1-1,y1-1)-getSum(x1-1,y2)-getSum(x2,y1-1));
              }
        else  break;
    }
    return 0;
}