POJ1195Mobile phones

二维树状数组板子题。

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cstdlib>
 #include<algorithm>
 #include<cmath>
 #include<vector>
 using namespace std;
 #define mem(a,b) memset(a,b,sizeof(a))
 #define ll long long
 #define inf 1000000000
 #define maxn 40000
 #define eps 1e-12
 #define mod 1000000007
 #define N 3005
 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch<''||ch>'') {if(ch=='-') f=-;ch=getchar();}
     while(ch>=''&&ch<='') {x=*x+ch-'';ch=getchar();}
     return x*f;
 }
 int c[N][N],n;
 int lowbit(int i)
 {
     return i&(-i);
 }
 int sum(int x,int y)
 {
     int ret=;
     for(int i=x;i>;i-=lowbit(i))
     {
         for(int j=y;j>;j-=lowbit(j))
           ret+=c[i][j];
     }
     return ret;
 }
 void add(int x,int y,int d)
 {
      for(int i=x;i<=n;i+=lowbit(i))
       for(int j=y;j<=n;j+=lowbit(j))
       {
           c[i][j]+=d;
       }
 }
 int main()
 {
     int k,op,x,y,i,j;
     while(~scanf("%d%d",&i,&n))
     {
         mem(c,);
         while()
         {
             op=read();
             if(op==) break;
             if(op==) {
                 x=read();y=read();k=read();
                 add(x+,y+,k);
             }
             else{
                 int l,b,r,t;
                 l=read();b=read();r=read();t=read();
                 l++;b++;r++;t++;
                 printf("%d\n",sum(r,t)-sum(r,b-)-sum(l-,t)+sum(l-,b-));
             }
         }
     }
     return ;
 }