uva 11992 Fast Matrix Operations

题目链接： uva 11992 Fast Matrix Operations

题目大意： 你有$r\ast c(r<=20,r\ast c<=10^6)$的数字矩阵，每次可以将$(x_1,y_1)(x_2,y_2)$之间的数字加一个值，或将$(x_1,y_1)(x_2,y_2)$之间的数字改为一个值，或查询$(x_1,y_1)(x_2,y_2)$之间数字的和，最大值和最小值。

题目分析： 由于题目中行数很少，所以我们可以建$r$棵线段树，每次查询操作时对于$(x_1,x_2)$之间的线段树都进行一次操作，最后再统计答案。

题目代码：
（指针建树，写的丑轻喷）

#include<stdio.h>
#include<algorithm>
#define inf 1000000000
using namespace std;
typedef struct Node{
	int maxn,minn,sum;
	int lazy1,lazy2;
	Node *L,*R;
	int F,T;
}SegmentTree,*LE;
LE tree[21];
LE Null;
void Build(LE &k,int L,int R){
	k=new Node;
	k->F=L;
	k->T=R;
	k->L=Null;
	k->lazy1=k->lazy2=0;
	k->maxn=k->minn=k->sum=0;
	k->R=Null;
}
void Pushdown1(LE &k){
	int mid=(k->T+k->F)>>1;
	if(k->L==Null)Build(k->L,k->F,mid);
	if(k->R==Null)Build(k->R,mid+1,k->T);
	k->L->maxn+=k->lazy1;
	k->R->maxn+=k->lazy1;
	k->L->minn+=k->lazy1;
	k->R->minn+=k->lazy1;
	k->L->sum+=(mid-k->F+1)*k->lazy1;
	k->R->sum+=(k->T-mid)*k->lazy1;
	k->L->lazy1+=k->lazy1;
	k->R->lazy1+=k->lazy1;
	k->lazy1=0;
}
void Pushdown2(LE &k){
	int mid=(k->T+k->F)>>1;
	if(k->L==Null)Build(k->L,k->F,mid);
	if(k->R==Null)Build(k->R,mid+1,k->T);
	k->L->maxn=k->lazy2;
	k->R->maxn=k->lazy2;
	k->L->minn=k->lazy2;
	k->R->minn=k->lazy2;
	k->L->sum=(mid-k->F+1)*k->lazy2;
	k->R->sum=(k->T-mid)*k->lazy2;
	k->L->lazy2=k->lazy2;
	k->R->lazy2=k->lazy2;
	k->L->lazy1=0;
	k->R->lazy1=0;
	k->lazy2=0;
}
void renew(LE &k){
	if(k->L==Null)k->L->sum=0,k->L->maxn=0,k->L->minn=0;
	if(k->R==Null)k->R->sum=0,k->R->maxn=0,k->R->minn=0;
	k->maxn=max(k->L->maxn,k->R->maxn);
	k->minn=min(k->L->minn,k->R->minn);
	k->sum=k->L->sum+k->R->sum;
}
void Update1(LE &k,int L,int R,int l,int r,int v){
	if(k==Null)Build(k,L,R);
	if(l<=L&&r>=R){
		k->lazy1+=v;
		k->maxn+=v;
		k->minn+=v;
		k->sum+=(R-L+1)*v;
		return;
	}
	if(k->lazy2)Pushdown2(k);
	if(k->lazy1)Pushdown1(k);
	int mid=(L+R)>>1;
	if(r<=mid)Update1(k->L,L,mid,l,r,v);
	else if(l>mid)Update1(k->R,mid+1,R,l,r,v);
	else Update1(k->L,L,mid,l,mid,v),Update1(k->R,mid+1,R,mid+1,r,v);
	renew(k);
}
void Update2(LE &k,int L,int R,int l,int r,int v){
	if(k==Null)Build(k,L,R);
	if(l<=L&&r>=R){
		k->lazy1=0;
		k->lazy2=v;
		k->maxn=k->minn=v;
		k->sum=(R-L+1)*v;
		return;
	}
	if(k->lazy2)Pushdown2(k);
	if(k->lazy1)Pushdown1(k);
	int mid=(L+R)>>1;
	if(r<=mid)Update2(k->L,L,mid,l,r,v);
	else if(l>mid)Update2(k->R,mid+1,R,l,r,v);
	else Update2(k->L,L,mid,l,mid,v),Update2(k->R,mid+1,R,mid+1,r,v);
	renew(k);
}
int Query_sum(LE k,int l,int r){
	if(k==Null)return 0;
	if(l<=k->F&&r>=k->T)return k->sum;
	if(k->lazy2)Pushdown2(k);
	if(k->lazy1)Pushdown1(k);
	int mid=(k->F+k->T)>>1;
	if(r<=mid)return Query_sum(k->L,l,r);
	else if(l>mid)return Query_sum(k->R,l,r);
	else return Query_sum(k->L,l,mid)+Query_sum(k->R,mid+1,r);
}
int Query_max(LE k,int l,int r){
	if(k==Null)return 0;
	if(l<=k->F&&r>=k->T)return k->maxn;
	if(k->lazy2)Pushdown2(k);
	if(k->lazy1)Pushdown1(k);
	int mid=(k->F+k->T)>>1;
	if(r<=mid)return Query_max(k->L,l,r);
	else if(l>mid)return Query_max(k->R,l,r);
	else return max(Query_max(k->L,l,mid),Query_max(k->R,mid+1,r));
}
int Query_min(LE k,int l,int r){
	if(k==Null)return 0;
	if(l<=k->F&&r>=k->T)return k->minn;
	if(k->lazy2)Pushdown2(k);
	if(k->lazy1)Pushdown1(k);
	int mid=(k->F+k->T)>>1;
	if(r<=mid)return Query_min(k->L,l,r);
	else if(l>mid)return Query_min(k->R,l,r);
	else return min(Query_min(k->L,l,mid),Query_min(k->R,mid+1,r));
}
int main()
{
	int r,c,m,opt,x1,x2,y1,y2,v;
	Null=new Node;
	Null->F=Null->T=0;
	Null->lazy1=Null->lazy2=0;
	Null->maxn=Null->minn=Null->sum=0;
	Null->L=Null->R=Null;
	while(scanf("%d %d %d",&r,&c,&m)!=EOF){
		for(int i=1;i<=20;i++)
			tree[i]=Null;
		for(int i=1;i<=m;i++){
			scanf("%d",&opt);
			if(opt==1){
				scanf("%d %d %d %d %d",&x1,&y1,&x2,&y2,&v);
				if(x1>x2)swap(x1,x2);
				if(y1>y2)swap(y1,y2);
				for(int i=x1;i<=x2;i++)
					Update1(tree[i],1,c,y1,y2,v);
			}
			if(opt==2){
				scanf("%d %d %d %d %d",&x1,&y1,&x2,&y2,&v);
				if(x1>x2)swap(x1,x2);
				if(y1>y2)swap(y1,y2);
				for(int i=x1;i<=x2;i++)
					Update2(tree[i],1,c,y1,y2,v);
			}
			if(opt==3){
				scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
				if(x1>x2)swap(x1,x2);
				if(y1>y2)swap(y1,y2);
				int sum=0,maxn=0,minn=inf;
				for(int i=x1;i<=x2;i++){
					maxn=max(maxn,Query_max(tree[i],y1,y2));
					minn=min(minn,Query_min(tree[i],y1,y2));
					sum+=Query_sum(tree[i],y1,y2);
				}
				printf("%d %d %d\n",sum,minn,maxn);
			}
		}
	}
	return 0;
}