线段树维护区间Sum Max Min

#include <bits/stdc++.h>		//线段树维护区间和
#define ll long long
#define inf 0x3f3f3f3f 
using namespace std;
const int maxn = 1e5+7;
int a[10000];
struct node{
   
	int l,r;
	ll add;
	ll sum;
	ll maxx;
	ll minn;
}tree[maxn<<2];
void pushup(int index){
   		//更新值
	tree[index].sum = tree[index<<1].sum+tree[index<<1|1].sum;  
    tree[index].maxx = max(tree[index<<1].maxx,tree[index<<1|1].maxx);  
    tree[index].minn = min(tree[index<<1].minn,tree[index<<1|1].minn);  
}
void pushdown(int index){
   	//下推标记
	if(tree[index].add){
   
 		tree[index<<1].sum += (tree[index<<1].r-tree[index<<1].l+1)*tree[index].add;  
        tree[index<<1|1