poj 1195 二維樹狀陣列

裸的二維樹狀陣列模板題

求和公式注意了。

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
using namespace std;
int n;
int c[1111][1111];
int a[1111][1111];
#pragma comment(lingker,"/STACK:36777216") //hdu外掛
//輸入優化
inline void RD(int &ret)
{
    char c;
    do
    {
        c=getchar();
    }while(c<'0'||c>'9');
    ret=c-'0';
    while((c=getchar())>='0'&&c<='9')
        ret=ret*10+(c-'0');
}
//輸出優化
inline void OT(int a)
{
    if(a>=10)
        OT(a/10);
    putchar(a%10+'0');
}
int lowbit(int x)
{
    return x&(-x);
}
void add(int i,int j,int detal)
{
    int x,y;
    for(x=i;x<=n;x+=lowbit(x))
    {
        for(y=j;y<=n;y+=lowbit(y))
        {
            c[x][y]+=detal;
        }
    }
}
int sum(int i,int j)
{
    int x,y;
    int ans=0;
    for(x=i;x>0;x-=lowbit(x))
    {
        for(y=j;y>0;y-=lowbit(y))
        {
            ans+=c[x][y];
        }
    }
    return ans;
}
int main()
{
    int f,x1,y1,x2,y2,num;
    while(scanf("%d",&f))
    {
        if(f==3)
            break;
        if(f==0)
            scanf("%d",&n);
        if(f==1)
        {
            scanf("%d%d%d",&x1,&y1,&num);
           // cin>>x1>>y1>>num;
            x1++;
            y1++;
            add(x1,y1,num);
        }
        if(f==2)
        {
            scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
           // cin>>x1>>y1>>x2>>y2;
            x1++;
            y1++;
            x2++;
            y2++;
            //求和注意
            printf("%d\n",sum(x2,y2)+sum(x1-1,y1-1)-sum(x2,y1-1)-sum(x1-1,y2));
            //cout<<sum(x2,y2)-sum(x1,y1)<<endl;
        }
    }
    return 0;
}