二维树状数组

链接网址：点击打开链接http://www.tyvj.cn/Problem_Upload.asp?id=1474

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int  N=1500; 
int a[N][N],n;

int lowbit(int x)
{
 return x & (-x);
}
void change(int x,int y,int k)
{
     for(int i=x;i<=n;i+=lowbit(i))
         for(int j=y;j<=n;j+=lowbit(j))
            a[i][j]+=k;
}

int getsum(int x,int y)
{
    int i,j,sum=0;
    for(i=x;i>0;i-=lowbit(i))
       for(j=y;j>0;j-=lowbit(j))
          sum+=a[i][j];
    return sum;
}

int main()
{
    int m,x,y,k,ex,ey;
    cin>>n;
    memset(a,0,sizeof(a));    
    while(scanf("%d",&m)){
         
          if(m==1){
            scanf("%d%d%d",&x,&y,&k);           
            change(++x,++y,k);             
          }     
          else if(m==2){
             scanf("%d%d%d%d",&x,&y,&ex,&ey);
             //ex++;ey++;//x++;y++;
             int ans=getsum(ex+1,ey+1)+getsum(x,y)-getsum(x,ey+1)-getsum(ex+1,y);
             cout<<ans<<endl;         
          } 
          else break;
    }
    //system("pause");
    return 0;
}