线段树模板

贴一份线段树的区间修改和查询大模板

const int N = 1e6+5;

int a[N],n;  //输入数据,构造线段树数组

struct node{
    int lft,rht;
    int sum;    //区间和
    int maxx;   //区间最大值
    int minn;   //区间最小值
    int lazy;   //延迟标记,减小时间复杂度
}segTree[N*4];  //需要开4倍

void pushUp(int id){    //区间合并,上放
    segTree[id].sum = segTree[id*2].sum+segTree[id*2+1].sum;
    segTree[id].maxx = max(segTree[id*2].maxx,segTree[id*2+1].maxx);
    segTree[id].minn = min(segTree[id*2].sum+segTree[id*2+1].sum);
}

void pushDown(int id){
    if(segTree[id].lazy){   //区间修改过,需要下放
        //在原来的值上加上val
        segTree[id*2].sum += (segTree[id*2].rht-segTree[id*2].lft+1)*segTree[id].lazy;
        segTree[id*2+1].sum += (segTree[id*2+1].rht-segTree[id*2+1].lft+1)*segTree[id].lazy;
        segTree[id*2].maxx += segTree[id].lazy;
        segTree[id*2+1].maxx += segTree[id].lazy;
        segTree[id*2].minn += segTree[id].lazy;
        segTree[id*2+1].minn += segTree[id].lazy;
        segTree[id*2].lazy += segTree[id].lazy;
        segTree[id*2+1].lazy += segTree[id].lazy;
        segTree[id].lazy = 0;
        //把原来的值变成val
        segTree[id*2].sum = (segTree[id*2].rht-segTree[id*2].lft+1)*segTree[id].lazy;
        segTree[id*2+1].sum = (segTree[id*2+1].rht-segTree[id*2+1].lft+1)*segTree[id].lazy;
        segTree[id*2].maxx = segTree[id].lazy;
        segTree[id*2+1].maxx = segTree[id].lazy;
        segTree[id*2].minn = segTree[id].lazy;
        segTree[id*2+1].minn = segTree[id].lazy;
        segTree[id*2].lazy = segTree[id].lazy;
        segTree[id*2+1].lazy = segTree[id].lazy;
        segTree[id].lazy = 0;
    }
}

void build(int id,int l,int r){
    segTree[id].lft = l, segTree[id].rht = r;
    segTree[id].lazy = 0, segTree[id].sum = 0;   //开始一定要清0
    if(l == r){            //到达叶子节点,不继续建树
        segTree[id].sum = a[l];
        segTree[id].maxx = a[l];
        segTree[id].minn = a[l];
    }
    else{                  //否则继续建树
        int mid = (l+r)>>1;
        build(id*2,l,mid);
        build(id*2+1,mid+1,r);
        pushUp(id);
    }
}

void upDate(int id,int l,int r,int val){    //更新l~r区间,加val,或减val(就传-val),或改成val
    if(l<=segTree[id].lft&&r>=segTree[id].rht){
        /*1.把原来的值加上val,因为该区间有segTree[id].rht-segTree[index].lft+1
        个数，所以区间和 以及 最值为：*/
        segTree[id].sum += (segTree[id].rht-segTree[id].lft+1)*val;
        segTree[id].maxx += val;
        segTree[id].minn += val;
        segTree[id].lazy += val;  //延迟标记
        /*2.把原来的值改成val,因为该区间有segTree[id].rht-segTree[index].lft+1
        个数，所以区间和 以及 最值为：*/
        segTree[id].sum = (segTree[id].rht-segTree[id].lft+1)*val;
        segTree[id].maxx = val;
        segTree[id].minn = val;
        segTree[id].lazy = val;  //延迟标记
    }
    else{
        pushDown(id);   //区间下放
        int mid = (segTree[id].lft+segTree[id].rht)>>1;
        if(r <= mid)
            upDate(id*2,l,r,val);
        else if(l>=mid+1)
            upDate(id*2+1,l,r,val);
        else{
            upDate(id*2,l,r,val);
            upDate(id*2+1,l,r,val);
        }
        pushUp(id);
    }
}

int query(int id,int l,int r){  //查询l~r的值
    if(l<=segTree[id].lft&&r>=segTree[id].rht){  //该区间包含在查询区间内，可直接返回
        return segTree[id].sum;
        //return segTree[id].maxx;
        //return segTree[id].minn;
    }
    pushDown(id);  //区间下放
    int mid = (segTree[id].lft+segTree[id].rht)>>1;
    int ans = 0;
    int maxx = -INF;
    int minn = INF;
    if(r<=mid){  //只用管左子树
        ans += query(id*2,l,r);
        maxx = max(maxx,query(id*2,l,r));
        minn = min(minn,query(id*2,l,r));
    }
    else if(l>=mid+1){  //只用管右子树
        ans+=query(id*2+1,l,r);
        maxx = max(maxx,query(id*2+1,l,r));
        minn = min(minn,query(id*2+1,l,r));
    }
    else{
        ans += query(id*2,l,r)+query(id*2+1,l,r);
        maxx = max(maxx,max(query(id*2,l,r),query(id*2+1,l,r)));
        minn = min(minn,min(query(id*2,l,r),query(id*2+1,l,r)));
    }
    return ans;
    //return maxx;
    //return minn;
}