[Vijos1512] SuperBrother打鼹鼠 （二维树状数组）

传送门

直接搞就行。

注意下表re从零开始，而树状数组搞不了0，所以统一增加一个偏移量1.

（话说数据随机是什么鬼？）

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <string>
 # include <cmath>
 # include <vector>
 # include <map>
 # include <queue>
 # include <cstdlib>
 # define MAXN
 using namespace std;

 inline int get_num() {
     int k = , f = ;
     char c = getchar();
     for(; !isdigit(c); c = getchar()) if(c == '-') f = -;
     for(; isdigit(c); c = getchar()) k = k *  + c - '';
     return k * f;
 }

 int n;
 int c[MAXN][MAXN];
 inline int lowbit(int x)
 {
     return x & -x;
 }

 inline void add(int x, int y, int k)
 {
     int i, j;
     for(i = x; i <= n; i += lowbit(i))
         for(j = y; j <= n; j += lowbit(j))
             c[i][j] += k;
 }

 inline int query(int x, int y)
 {
     int i, j, ans = ;
     for(i = x; i; i -= lowbit(i))
         for(j = y; j; j -= lowbit(j))
             ans += c[i][j];
     return ans;
 }

 int main()
 {
     int i, x, y, k, x1, x2, y1, y2, m;
     n = get_num() + ;
     while()
     {
         m = get_num();
         if(m == ) break;
         if(m == )
         {
             x = get_num() + ;
             y = get_num() + ;
             k = get_num();
             add(x, y, k);
         }
         else
         {
             x1 = get_num() + ;
             y1 = get_num() + ;
             x2 = get_num() + ;
             y2 = get_num() + ;
             printf("%d\n", query(x2, y2) - query(x1 - , y2) - query(x2, y1 - ) + query(x1 - , y1 - ));
         }
     }
     return ;
 }