入门入门入门线段树模板

先写模板，日后填坑

本模板实现数组中对一个区间中每一个的值加减操作和一个区间的和的计算
题目：洛谷P3372

模板一：

typedef long long ll;
using namespace std;
struct _tree
{
    int l;
    int r;
    ll tag;
    ll sum;
}tree[400005];
ll a[100005];
void pushup(int p)
{
    tree[p].sum=tree[p<<1].sum+tree[p<<1|1].sum;
}
void pushdown(int p)
{
    if(tree[p].tag)
    {
        tree[p<<1].tag+=tree[p].tag;
        tree[p<<1|1].tag+=tree[p].tag;
        tree[p<<1].sum+=tree[p].tag*(tree[p<<1].r-tree[p<<1].l+1);
        tree[p<<1|1].sum+=tree[p].tag*(tree[p<<1|1].r-tree[p<<1|1].l+1);
        tree[p].tag=0;
    }
}
void build(int p,int l,int r)
{
    tree[p].l=l;
    tree[p].r=r;
    tree[p].tag=0;
    if(l==r)
    {
        tree[p].sum=a[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid+1,r);
    pushup(p);
}
void add_node(int p,int node,int num)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==r)
    {
        tree[p].sum+=num;
        return ;
    }
    pushdown(p);
    int mid=(l+r)>>1;
    if(node<=mid)
        add_node(p<<1,node,num);
    else
        add_node(p<<1|1,node,num);
    pushup(p);
}
void add_range(int p,int s,int t,int num)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==s&&r==t)
    {
        tree[p].sum+=num*(tree[p].r-tree[p].l+1);
        tree[p].tag+=num;
        return ;
    }
    pushdown(p);
    int mid=(l+r)>>1;
    if(t<=mid)
        add_range(p<<1,s,t,num);
    else if(s>mid)
        add_range(p<<1|1,s,t,num);
    else
    {
        add_range(p<<1,s,mid,num);
        add_range(p<<1|1,mid+1,t,num);
    }
    pushup(p);
}
ll get_node(int p,int node)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==r)
        return tree[p].sum;
    pushdown(p);
    int mid=(l+r)>>1;
    if(node<=mid)
        return get_node(p<<1,node);
    else
        return get_node(p<<1|1,node);
}
ll get_range(int p,int s,int t)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==s&&r==t)
        return tree[p].sum;
    pushdown(p);
    int mid=(l+r)>>1;
    if(t<=mid)
        return get_range(p<<1,s,t);
    else if(s>mid)
        return get_range(p<<1|1,s,t);
    else
        return get_range(p<<1,s,mid)+get_range(p<<1|1,mid+1,t);
}

模板二：

typedef long long ll;
using namespace std;
struct _tree
{
    int l;
    int r;
    ll tag;
    ll mul=1;
    ll sum;
}tree[400005];
ll a[100005];
int n,m,mod;
void pushup(int p)
{
    tree[p].sum=(tree[p<<1].sum+tree[p<<1|1].sum)%mod;
}
void pushdown(int p)
{
    if(tree[p].mul!=1)
    {
        tree[p<<1].mul=(tree[p<<1].mul*tree[p].mul)%mod;
        tree[p<<1|1].mul=(tree[p<<1|1].mul*tree[p].mul)%mod;
        tree[p<<1].tag=(tree[p<<1].tag*tree[p].mul)%mod;
        tree[p<<1|1].tag=(tree[p<<1|1].tag*tree[p].mul)%mod;
        tree[p<<1].sum=(tree[p<<1].sum*tree[p].mul)%mod;
        tree[p<<1|1].sum=(tree[p<<1|1].sum*tree[p].mul)%mod;
        tree[p].mul=1;
    }
    if(tree[p].tag)
    {
        tree[p<<1].tag=(tree[p].tag+tree[p<<1].tag)%mod;
        tree[p<<1|1].tag=(tree[p].tag+tree[p<<1|1].tag)%mod;
        tree[p<<1].sum=(tree[p<<1].sum+tree[p].tag*(tree[p<<1].r-tree[p<<1].l+1))%mod;
        tree[p<<1|1].sum=(tree[p<<1|1].sum+tree[p].tag*(tree[p<<1|1].r-tree[p<<1|1].l+1))%mod;
        tree[p].tag=0;
    }
}
void build(int p,int l,int r)
{
    tree[p].l=l;
    tree[p].r=r;
    tree[p].tag=0;
    tree[p].mul=1;
    if(l==r)
    {
        tree[p].sum=a[l]%mod;
        return ;
    }
    int mid=(l+r)>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid+1,r);
    pushup(p);
}
void add_range(int p,int s,int t,ll num)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==s&&r==t)
    {
        tree[p].sum=(tree[p].sum+num*(tree[p].r-tree[p].l+1))%mod;
        tree[p].tag=(tree[p].tag+num)%mod;
        return ;
    }
    pushdown(p);
    int mid=(l+r)>>1;
    if(t<=mid)
        add_range(p<<1,s,t,num);
    else if(s>mid)
        add_range(p<<1|1,s,t,num);
    else
    {
        add_range(p<<1,s,mid,num);
        add_range(p<<1|1,mid+1,t,num);
    }
    pushup(p);
}
void mul_range(int p,int s,int t,ll num)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==s&&r==t)
    {
        tree[p].sum=(tree[p].sum*num)%mod;
        tree[p].tag=(tree[p].tag*num)%mod;
        tree[p].mul=(tree[p].mul*num)%mod;
        return ;
    }
    pushdown(p);
    int mid=(l+r)>>1;
    if(t<=mid)
        mul_range(p<<1,s,t,num);
    else if(s>mid)
        mul_range(p<<1|1,s,t,num);
    else
    {
        mul_range(p<<1,s,mid,num);
        mul_range(p<<1|1,mid+1,t,num);
    }
    pushup(p);
}
ll get_range(int p,int s,int t)
{
    int l=tree[p].l;
    int r=tree[p].r;
    if(l==s&&r==t)
        return tree[p].sum%mod;
    pushdown(p);
    int mid=(l+r)>>1;
    if(t<=mid)
        return get_range(p<<1,s,t);
    else if(s>mid)
        return get_range(p<<1|1,s,t);
    else
        return (get_range(p<<1,s,mid)+get_range(p<<1|1,mid+1,t))%mod;
}