线段树模板

支持区间修改（单点修改（雾），查询区间和，查询区间最大值，查询区间最小值 ；

#include<iostream>
#include<cstdio>
using namespace std;
int n;
const int size = 200010;
struct xd_tree
{
    int l,r,p,min,max,sum,add;
    bool swc;
}tree[size*4];
int num[size];
void update(int p)
{
    tree[p].sum = tree[p*2].sum + tree[p*2+1].sum;
    tree[p].min = min(tree[p*2].min,tree[p*2+1].min);
    tree[p].max = max(tree[p*2].max,tree[p*2+1].max);
}
void build(int p,int l,int r)
{
    tree[p].l = l , tree[p].r = r;
    if(l == r)
    {
        tree[p].sum = tree[p].min = tree[p].max = num[l];
        return ;
    }
    int mid = (l + r) >> 1;
    build(p*2,l,mid);
    build(p*2+1,mid+1,r);
    update(p);
}
void spread(int p)
{
    if(tree[p].add)
    {
        tree[p*2].max += tree[p].add;
        tree[p*2+1].max += tree[p].add;
        tree[p*2].min += tree[p].add;
        tree[p*2+1].min += tree[p].add;
        tree[p*2].sum += tree[p].add * (tree[p*2].r - tree[p*2].l + 1);
        tree[p*2+1].sum += tree[p].add * (tree[p*2+1].r - tree[p*2+1].l + 1);
        tree[p*2].add += tree[p].add;
        tree[p*2+1].add += tree[p].add;
        tree[p].add = 0;
    }
}
void change(int p,int l,int r,int x)
{
    if(tree[p].l >= l && tree[p].r <= r)
    {
        tree[p].sum += x*(tree[p].r - tree[p].l + 1);
        tree[p].max += x;
        tree[p].min += x;
        tree[p].add += x;
        return ;
    }
    spread(p);
    int mid = (tree[p].l + tree[p].r) >> 1;
    if(l <= mid)
        change(p*2,l,r,x);
    if(r > mid)
        change(p*2+1,l,r,x);
    update(p);
}
int ask_sum(int p,int l,int r)
{
    if(tree[p].l >= l && tree[p].r <= r)
    {
        return tree[p].sum;
    }
    spread(p);
    int mid = (tree[p].l + tree[p].r) >> 1;
    int ans = 0;
    if(l <= mid)
        ans += ask_sum(p*2,l,r);
    if(r > mid)
        ans += ask_sum(p*2+1,l,r);
    return ans;
}
int ask_max(int p,int l,int r)
{
    if(tree[p].l >= l && tree[p].r <= r)
    {
        return tree[p].max;
    }
    spread(p);
    int mid = (tree[p].l + tree[p].r) >> 1;
    int ans = 0;
    if(l <= mid)
        ans = max(ask_max(p*2,l,r),ans);
    if(r > mid)
        ans = max(ans,ask_max(p*2+1,l,r));
    return ans;
}
int ask_min(int p,int l,int r)
{
    if(tree[p].l >= l && tree[p].r <= r)
    {
        return tree[p].min;
    }
    spread(p);
    int mid = (tree[p].l + tree[p].r) >> 1;
    int ans = 232323223;
    if(l <= mid)
        ans = min(ask_min(p*2,l,r),ans);
    if(r > mid)
        ans = min(ans,ask_min(p*2+1,l,r));
    return ans;
}
int main()
{
    scanf("%d",&n);
    for(int i = 1 ; i <= n ; i ++)
        scanf("%d",&num[i]);
    build(1,1,n);
    int ins;
    //1区间修改，2查询区间和，3查询区间最大值，4查询区间最小值
    while(scanf("%d",&ins) != EOF)
    {
        if(ins == 1)
        {
            int l,r,x;
            scanf("%d%d%d",&l,&r,&x);
            change(1,l,r,x);
        }
        if(ins == 2)
        {
            int l,r;
            scanf("%d%d",&l,&r);
            printf("%d\n",ask_sum(1,l,r));
        }
        if(ins == 3)
        {
            int l,r;
            scanf("%d%d",&l,&r);
            printf("%d\n",ask_max(1,l,r));
        }
        if(ins == 4)
        {
            int l,r;
            scanf("%d%d",&l,&r);
            printf("%d\n",ask_min(1,l,r));
        }
    }
    return 0;
}