POJ1195-二维数组

题目：题目链接

 

题意：

实现操作：

1.add(x,y,a).对二维数组的第x行,第y列加上a.

2.sum(l,b,r,t).求所有满足l<=x<=r,b<=y<=t,的数组元素的和.

 

分析：见证了二维树状数组，这应该算是很水很水的二维树状数组了吧。表示数据结构强大。注意题目给出的下标问

题....

 

代码：

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
#define maxn 1050
int n;
int c[maxn][maxn];
int QuickMod(int  a,int b,int n)
{
    int r = 1;
    while(b)
    {
        if(b&1)
            r = (r*a)%n;
        a = (a*a)%n;
        b >>= 1;
    }
    return r;
}
int lowbit(int x)
{
    return x&(-x);
}
void add(int x, int y, int val)
{
    for(int i = x; i <= n; i += lowbit(i))
    {
        for(int j = y; j <= n; j += lowbit(j))
        c[i][j] += val;
    }
}

int sum(int x, int y)
{
    int ans = 0;
    for(int i = x; i > 0; i -= lowbit(i))
    {
        for(int j = y; j > 0; j -= lowbit(j))
        ans += c[i][j];
    }
    return ans;
}
int main()
{
    int X, Y, A;
    int L, B, R, T;
    int t;
    while(scanf("%d", &t) == 1)
    {
        scanf("%d", &n);
        mem(c, 0);
        while(scanf("%d", &t))
        {
            if(t == 3)
            break;
            else if(t == 1)
            {
                scanf("%d%d%d", &X, &Y, &A);
                add(X+1, Y+1, A);
            }
            else if(t == 2)
            {
                scanf("%d%d%d%d", &L, &B, &R, &T);
                printf("%d\n", sum(R+1, T+1) - sum(R+1, B) - sum(L, T+1) + sum(L, B));
            }
        }
    }
    return 0;
}

 

膜拜数据结构.....