线段树模版

#include <cstdio>
#include <algorithm>
using namespace std;
struct me{
    int value;
    int flage;
}my[400005];
int v[100005];
void m_build(int root,int left,int right){
    my[root].flage=0;//延迟标记
    if(left==right)
        my[root].value=v[left];
    else{
        int mid=(left+right)/2;
        m_build(root*2+1, left, mid);
        m_build(root*2+2, mid+1, right);
        my[root].value=min(my[root*2+1].value,my[root*2+2].value);
    }
}
void m_pushdown(int root){//传递
    if(my[root].flage!=0){
        my[root*2+1].flage+=my[root].flage;
        my[root*2+2].flage+=my[root].flage;
        my[root*2+1].value+=my[root].flage;
        my[root*2+2].value+=my[root].flage;
        my[root].flage=0;
    }
}
int m_find(int root,int m_l,int m_r,int left,int right){
    if(m_l>right||m_r<left)
        return 0xfffffff;
    if(m_l<=left&&m_r>=right)
        return my[root].value;
    m_pushdown(root);
    int mid=(left+right)/2;
    return min(m_find(root*2+1, m_l, m_r, left, mid),m_find(root*2+2, m_l, m_r, mid+1, right));
}
void m_updata(int root,int value,int m_l,int m_r,int left,int right){
    if(m_r<left||m_l>right)
        return;
    if(m_l<=left&&m_r>=right){
        my[root].flage+=value;
        my[root].value+=value;
        return;
    }
    m_pushdown(root);//作用是为了上次更行剩下的部分
    int mid=(left+right)/2;
    m_updata(root*2+1, value, m_l, m_r, left, mid);
    m_updata(root*2+2, value, m_l, m_r, mid+1, right);
    my[root].value=min(my[root*2+1].value,my[root*2+2].value);
}
int main() {
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    m_build(0, 1, n);
    int q;
    int qa,qb,value,ta,tb;
    scanf("%d",&q);
    while (q--) {
        scanf("%d%d%d",&qa,&qb,&value);
        m_updata(0, value, qa, qb, 1, n);
        scanf("%d%d",&ta,&tb);
        printf("%d\n",m_find(0, ta, tb, 1, n));
    }
    return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;
struct xy{
    long long value;
    long long flage;
}a[400005],b[400005];
long long v[100005];
void m_build(int root,long long left,long long right,struct xy (&c)[400005]){
    c[root].flage=-1;//延迟标记
    if(left==right)
        c[root].value=v[left];
    else{
        long long mid=(left+right)/2;
        m_build(root*2+1, left, mid,c);
        m_build(root*2+2, mid+1, right,c);
        c[root].value=c[root*2+1].value+c[root*2+2].value;
    }
}
void m_pushdown(int root,struct xy (&c)[400005]){//传递
    if(c[root].flage>=0){
        c[root*2+1].flage=c[root].flage;
        c[root*2+2].flage=c[root].flage;
        c[root].flage=-1;
    }
}
long long m_find(int root,long long m_l,long long m_r,long long left,long long right,struct xy (&c)[400005]){
    if(m_l>right||m_r<left)
        return 0;
    if(m_l<=left&&m_r>=right){
        if(c[root].flage>=0){
            c[root].value=c[root].flage*(right-left+1);
            if(left!=right)
                m_pushdown(root,c);
        }
        return c[root].value;
    }
    if(left!=right)
        m_pushdown(root,c);
    long long mid=(left+right)/2;
    return m_find(root*2+1, m_l, m_r, left, mid,c)+m_find(root*2+2, m_l, m_r, mid+1, right,c);
}
void m_updata(int root,long long value,long long m_l,long long m_r,long long left,long long right,struct xy (&c)[400005]){
    if(m_r<left||m_l>right)
        return;
    if(m_l<=left&&m_r>=right){
        c[root].flage=value;
        c[root].value=(right-left+1)*value;
        if(left!=right)
            m_pushdown(root,c);
        return;
    }
    if(left!=right)
        m_pushdown(root,c);//作用是为了上次更行剩下的部分
    long long mid=(left+right)/2;
    m_updata(root*2+1, value, m_l, m_r, left, mid,c);
    m_updata(root*2+2, value, m_l, m_r, mid+1, right,c);
    c[root].value=c[root*2+1].value+c[root*2+2].value;
}