洛谷P3368 （线段树学习2）

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
const int maxn = 3e6 + 10;//注意根节点的大小范围 
#define in(a) a = read()
#define REP(i,k,n) for(long long i = k; i <= n; i++)
ll a[500010];
 
inline long long read()
{
    long long x=0, f=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-1;
    for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
    return x*f;
}

struct node{
    ll i, l, r, sum, lz; 
}tree[maxn];

//建树 
inline void build(ll i, ll l, ll r)
{
    tree[i].l = l, tree[i].r = r;
    if(l == r)
    {
        tree[i].sum = a[l];
        return ;
    }
    int mid = (l + r) >> 1;        
    build(i<<1, l, mid);
    build(i<<1|1, mid + 1, r);
    tree[i].sum = tree[i<<1].sum + tree[i<<1|1].sum;
    return ;
}

inline void push_down(ll i)
{
    if(tree[i].lz != 0)
    {
        tree[i<<1].lz += tree[i].lz;//将父亲的lz赋给左右儿子 
        tree[i<<1|1].lz += tree[i].lz;
        ll mid = (tree[i].l + tree[i].r ) / 2;
        tree[i<<1].sum += tree[i].lz * (mid - tree[i<<1].l + 1);
        tree[i<<1|1].sum += tree[i].lz * (tree[i<<1|1].r - mid);
        tree[i].lz = 0; 
    }
    return ;
}

//单点查询 
inline ll search_1(ll i, ll dis)
{
    if(tree[i].l == dis && tree[i].r == dis)
    {
        return tree[i].sum;
    }
    push_down(i);
    ll mid = (tree[i].l + tree[i].r ) / 2;
    if(dis <= mid)
        search_1(i<<1, dis);
    else
        search_1(i<<1|1, dis);
} 

//单点修改 
inline void add_1(ll i, ll dis, ll k)
{
    if(tree[i].l == tree[i].r )
    {
        tree[i].sum += k;
        return ;
    }
    if(dis <= tree[i<<1].r )
        add_1(i<<1, dis, k);
    else    add_1(i<<1|1, dis, k);
    tree[i].sum = tree[i<<1].sum + tree[i<<1|1].sum;//更新走过的所有sum值 
    return ;
}

//区间查询(sum) 
inline ll search(ll i, ll l, ll r)
{
    if(tree[i].l >= l && tree[i].r <= r)
    {
        return tree[i].sum;
    }
    if(tree[i].l > r || tree[i].r < l)
        return 0;
    int s = 0;
    if(tree[i<<1].r >= l)
        s += search(i<<1, l, r);
    if(tree[i<<1|1].l <= r)
        s += search(i<<1|1, l, r);
    return s;
}

//区间修改
inline void add(ll i, ll l, ll r, ll k)
{
    if(tree[i].l >= l && tree[i].r <= r)
    {
        tree[i].sum += k * (tree[i].r - tree[i].l + 1);
        tree[i].lz += k;
        return ;
    }
    push_down(i);
    ll mid = (tree[i].l + tree[i].r ) / 2;
    if(l <= mid)
        add(i<<1, l, r, k);
    if(r > mid)
        add(i<<1|1, l, r, k);
    tree[i].sum = tree[i<<1].sum + tree[i<<1|1].sum;//更新 
}

int main()
{
    ll n, m, c, l, r, dis, k;
    in(n);   in(m);
    REP(i, 1, n)   in(a[i]);
    build(1, 1, n);//建树
    
    REP(j, 1, m)
    {
        in(c);
        if(c == 1)
        {
            in(l);
            in(r);
            in(k);
            add(1, l, r, k);
        }
        if(c == 2)
        {
            in(dis);
            printf("%lld\n", search_1(1,dis));
        }
    }
        
    return 0;
}