基础数据结构之线段树

定义
root 为根节点
lson 为左子节点 (#define lson root <<1 )
rson为右子节点 (#definr rson root <<1 | 1)

线段树中的重要内容
1、定义结构体

struct Node
{
    ll l, r ;
    
    ll val, lazy;
} tr[10*MAXN];

定义 l r 代表 tr[x] 包含了从tr[ x ].l ~ tr[ x ].r的信息
val是该节点的值
lazy是为了进行区间操作的优化

2、几个重要操作

inline void Push_up(ll root)
{
    tr[root].val = tr[lson].val + tr[rson].val;
}

向上操作从底部开始完成树的建设和更新

inline void Push_dowm(ll root)
{   
    if(tr[root].lazy==0)
        return;
    tr[lson].val += tr[root].lazy * (tr[lson].r - tr[lson].l + 1);
    tr[rson].val += tr[root].lazy * (tr[rson].r - tr[rson].l + 1);

    tr[lson].lazy += tr[root].lazy;
    tr[rson].lazy += tr[root].lazy;

    tr[root].lazy = 0;
}

向下操作，实现区间操作的快速运算

3、初始化（建树）

void Build_Tree(ll root , ll l , ll r)
{
    tr[root].l = l, tr[root].r = r;
    if(l==r)
    {
        tr[root].val = input[l];
        return;
    }
    int mid = (l + r) >> 1;
    Build_Tree(lson, l, mid);
    Build_Tree(rson, mid + 1, r);
    Push_up(root);
}

4、区间加（也可以是单点加）

void Segment_Add(ll root, ll l, ll r, ll x)
{
    Push_dowm(root);
    if(tr[root].l>=l && tr[root].r<=r)
    {
        tr[root].val += x * (tr[root].r - tr[root].l + 1);
        tr[root].lazy += x;
        return;
    }
    int mid = (tr[root].l + tr[root].r) >> 1;
    if(r<=mid)
        Segment_Add(lson, l, r, x);
    else if(mid<l)
        Segment_Add(rson, l, r, x);
    else 
    {
        Segment_Add(lson, l, mid, x);
        Segment_Add(rson, mid + 1, r, x);
    }
    Push_up(root);
} 

5、区间查询

ll Segment_Query(ll root , ll l , ll r)
{
    Push_dowm(root);
    if(tr[root].l==tr[root].r)
    {
        return tr[root].val;
    }
    if(l<=tr[root].l && tr[root].r <=r)
    {
        return tr[root].val;
    }
    int mid = (tr[root].l + tr[root].r) >> 1;
    if(mid>=r)
        return Segment_Query(lson, l, r);
    else if(mid<l)
        return Segment_Query(rson, l, r);
    else return Segment_Query(lson,l,mid)+Segment_Query(rson,mid+1,r);
}

最后是可运行的代码

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
#define lson root << 1
#define rson root <<1|1
const  ll MAXN = 1e6+3;
ll input[MAXN];

struct Node
{
    ll l, r ;
    
    ll val, lazy;
} tr[10*MAXN];

inline void Push_up(ll root)
{
    tr[root].val = tr[lson].val + tr[rson].val;
}

inline void Push_dowm(ll root)
{   
    if(tr[root].lazy==0)
        return;
    tr[lson].val += tr[root].lazy * (tr[lson].r - tr[lson].l + 1);
    tr[rson].val += tr[root].lazy * (tr[rson].r - tr[rson].l + 1);

    tr[lson].lazy += tr[root].lazy;
    tr[rson].lazy += tr[root].lazy;

    tr[root].lazy = 0;
}


void Build_Tree(ll root , ll l , ll r)
{
    tr[root].l = l, tr[root].r = r;
    if(l==r)
    {
        tr[root].val = input[l];
        return;
    }
    int mid = (l + r) >> 1;
    Build_Tree(lson, l, mid);
    Build_Tree(rson, mid + 1, r);
    Push_up(root);
}

void Segment_Add(ll root, ll l, ll r, ll x)
{
    Push_dowm(root);
    if(tr[root].l>=l && tr[root].r<=r)
    {
        tr[root].val += x * (tr[root].r - tr[root].l + 1);
        tr[root].lazy += x;
        return;
    }
    int mid = (tr[root].l + tr[root].r) >> 1;
    if(r<=mid)
        Segment_Add(lson, l, r, x);
    else if(mid<l)
        Segment_Add(rson, l, r, x);
    else 
    {
        Segment_Add(lson, l, mid, x);
        Segment_Add(rson, mid + 1, r, x);
    }
    Push_up(root);
}   



    void Point_Add(int root, int dis, int val)
{
    if(tr[root].l==tr[root].r)
    {
        tr[root].val += val;
        return;
    }
    int mid = (tr[root].l + tr[root].r) >> 1;
    if(mid>=dis)
    {
        Point_Add(lson, dis, val);
    }
    else
        Point_Add(rson, dis, val);
    Push_up(root);
}

ll Segment_Query(ll root , ll l , ll r)
{
    Push_dowm(root);
    if(tr[root].l==tr[root].r)
    {
        return tr[root].val;
    }
    if(l<=tr[root].l && tr[root].r <=r)
    {
        return tr[root].val;
    }
    int mid = (tr[root].l + tr[root].r) >> 1;
    if(mid>=r)
        return Segment_Query(lson, l, r);
    else if(mid<l)
        return Segment_Query(rson, l, r);
    else return Segment_Query(lson,l,mid)+Segment_Query(rson,mid+1,r);
}
int main()
{
    ll n, m;
    scanf("%lld%lld", &n, &m);
    for (ll i = 1; i <= n; ++i)
    {
        scanf("%lld", &input[i]);
    }
    Build_Tree(1, 1, n);
    for (ll i = 1; i <= m; ++i)
    {
        ll flag;
        scanf("%lld", &flag);
        if(flag==1)
        {
            ll x, y;
            ll k;
            scanf("%lld%lld%lld", &x, &y, &k);
            Segment_Add(1, x, y, k);
        }
        else
        {
            ll x, y;
            scanf("%lld%lld", &x, &y);
            printf("%lld\n", Segment_Query(1, x, y));
        }
    }
}