HDU1892（二维树状数组）

题意很清楚：就是这部分的原理：sum(x1,y1)+sum(x2-1,y2-1)-sum(x1,y2-1)-sum(x2-1,y1);其实可以和概率论中的一个计算概率的问题结合起来。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxx=1105;
int bit[maxx][maxx];
int n;
int lowbit(int x){
	return x&(-x);
}
void add(int x,int y,int v){
	for(int i=x;i<maxx;i+=lowbit(i)){
		for(int j=y;j<maxx;j+=lowbit(j)){
			bit[i][j]+=v;
		}
	}
}
int sum(int x,int y){
	int s=0;
	for(int i=x;i>=1;i-=lowbit(i)){
		for(int j=y;j>=1;j-=lowbit(j)){
			s+=bit[i][j];
		}
	}
	return s;
}
int main(){
	char s[50];
	int t;
	scanf("%d",&t);
	int count=1;
	while(t--){
	    memset(bit,0,sizeof(bit));
		for(int i=1;i<maxx;i++){
			for(int j=1;j<maxx;j++){
				add(i,j,1);
			}
		}
		scanf("%d",&n);
		cout<<"Case "<<count++<<":"<<endl; 
		for(int i=1;i<=n;i++){
			int c;
			cin>>s;
			if(s[0]=='A'){
				int a,b;
				cin>>a>>b>>c;
				a++;b++;
				add(a,b,c);
			}else if(s[0]=='S'){
				int x1,y1,x2,y2;
				cin>>x1>>y1>>x2>>y2;
				x1++;y1++;y2++;x2++;
				if(x1<x2)swap(x1,x2);
				if(y1<y2)swap(y1,y2);
				int q=sum(x1,y1)+sum(x2-1,y2-1)-sum(x1,y2-1)-sum(x2-1,y1);
				cout<<q<<endl;
			}else if(s[0]=='D'){
				int x1,y1;
				cin>>x1>>y1>>c;
				x1++;y1++;
				int q=sum(x1,y1)+sum(x1-1,y1-1)-sum(x1,y1-1)-sum(x1-1,y1);
				int tmp=min(q,c);
				add(x1,y1,-tmp);
			}else {
				int x1,y1,x2,y2;
				cin>>x1>>y1>>x2>>y2>>c;
				x1++;y1++;y2++;x2++;
				int q=sum(x1,y1)+sum(x1-1,y1-1)-sum(x1,y1-1)-sum(x1-1,y1);
				int tmp=min(q,c);
				add(x1,y1,-tmp);
				add(x2,y2,tmp);
			}
		}
	}
	return 0;
}