题目链接:
http://poj.org/problem?id=1195
题意:
S*S的矩阵,两种操作
1 x y a, 在点(x,y)上加a
2 lx ly rx ry, 求矩形lx
题解:
二维树状数组。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e3+233;
int n,bit[maxn][maxn];
void add(int x,int y,int a){
for(int i=x; i<maxn; i+=i&-i)
for(int j=y; j<maxn; j+=j&-j)
bit[i][j] += a;
}
int sum(int x,int y){
int res = 0;
for(int i=x; i>0; i-=i&-i)
for(int j=y; j>0; j-=j&-j)
res += bit[i][j];
return res;
}
int main(){
int op; op=read(),n=read();
while(cin>>op && op!=3){
if(op==1){
int x=read(),y=read(),a=read();
++x,++y;
add(x,y,a);
}
if(op == 2){
int lx,rx,ly,ry;
cin >> lx >> ly >> rx >> ry;
++lx,++rx,++ly,++ry;
int ans = sum(rx,ry)-sum(rx,ly-1)-sum(lx-1,ry)+sum(lx-1,ly-1);
cout << ans << endl;
}
}
return 0;
}