线段树区间修改板子

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x
const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=2e6+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

struct Tree
{
	int sumv,maxv,minv;
}tree[maxn<<2];

int addv[maxn<<2],a[maxn];
int maxx=0,minn=inf,summ=0;

void pushup(Tree& root,Tree& lchild,Tree& rchild)
{
	root.sumv = (lchild.sumv+rchild.sumv);
	root.minv = min(lchild.minv,rchild.minv);
	root.maxv = max(lchild.maxv,rchild.maxv);
}

void build(int p,int l,int r)
{
	addv[p]=0;
	if(l==r){ tree[p].sumv=tree[p].minv=tree[p].maxv=a[l]; return ;}
	int mid = l+(r-l)/2;
	build(p*2, l, mid);
	build(p*2+1, mid+1, r);
	pushup(tree[p],tree[p*2],tree[p*2+1]);
}

void pushdown(int p,int len)
{
	addv[p*2]+=addv[p];
	addv[p*2+1]+=addv[p];
	tree[p*2].maxv+=addv[p];
	tree[p*2].minv+=addv[p];
	tree[p*2].sumv+=(ll)(len-len/2)*addv[p];
	tree[p*2+1].maxv+=addv[p];
	tree[p*2+1].minv+=addv[p];
	tree[p*2+1].sumv+=(ll)(len/2)*addv[p];
	addv[p]=0;
}

void add(int p,int l,int r,int addl,int addr,int v)
{
	if(addl<=l && addr>=r)
	{
		addv[p]+=v;
		tree[p].sumv+=(ll)(r-l+1)*addv[p];
		tree[p].minv+=addv[p];
		tree[p].maxv+=addv[p];
		return ;
	}
	pushdown(p, r-l+1);
	int mid=l+(r-l)/2;
	if(addl<=mid) add(p*2,l,mid,addl,addr,v);
	if(addr>mid) add(p*2+1, mid+1, r, addl, addr, v);
	pushup(tree[p],tree[p*2],tree[p*2+1]);
}

Tree query(int p,int l,int r,int ql,int qr)
{
	if(ql<=l && qr>=r) return tree[p];
	int mid=l+(r-l)/2;
	if(addv[p]) pushdown(p, r-l+1);
	if(qr<=mid) return query(p*2, l, mid, ql, qr);
	if(ql>mid) return query(p*2+1, mid+1, r, ql, qr);
	Tree ans;
	Tree a1 = query(p*2, l, mid, ql, qr);
	Tree a2 = query(p*2+1, mid+1, r, ql, qr);
	pushup(ans, a1, a2);
	return ans;
}

int main()
{
	int n;
	int cas=0;
	while(~scanf("%d",&n))
	{
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		build(1, 1, n);
		printf("Case %d:\n",++cas);
		string s;
		while(cin >> s)
		{
			if(s=="add")
			{
				int l,r,num;
				scanf("%d%d%d",&l,&r,&num);
				add(1, 1, n, l, r, num);
				cout << "Add complete!" << endl;
			}
			else if(s=="end") break;
			else
			{
				int l,r;
				scanf("%d%d",&l,&r);
				Tree ans=query(1, 1, n,l,r);
				printf("%d %d %d\n",ans.maxv,ans.minv,ans.sumv);
			}
		}
	}
}