ZKW线段树 非递归版本的线段树

学习和参考

下面是支持区间修改和区间查询的zkw线段树模板，先记下来。

#include <algorithm>
#include  <iterator>
#include  <iostream>
#include   <cstring>
#include   <iomanip>
#include   <cstdlib>
#include    <cstdio>
#include    <string>
#include    <vector>
#include    <bitset>
#include    <cctype>
#include     <queue>
#include     <cmath>
#include      <list>
#include       <map>
#include       <set>
//#include <unordered_map>
//#include <unordered_set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
using namespace std;
//#pragma GCC optimize(3)
//#pragma comment(linker, "/STACK:102400000,102400000")  //c++
#define lson (l , mid , rt << 1)
#define rson (mid + 1 , r , rt << 1 | 1)
#define debug(x) cerr << #x << " = " << x << "\n";
#define pb push_back
#define pq priority_queue

typedef long long ll;
typedef unsigned long long ull;

typedef pair<ll ,ll > pll;
typedef pair<int ,int > pii;
typedef pair<int ,pii> p3;
//priority_queue<int> q;//这是一个大根堆q
//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q
//__gnu_pbds::cc_hash_table<int,int>ret[11];    //这是很快的hash_map
#define fi first
#define se second
//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)
#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行
#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)
//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFFLL;  //
const ll nmos = 0x80000000LL;  //-2147483648
const int inf = 0x3f3f3f3f;
const ll inff = 0x3f3f3f3f3f3f3f3fLL; //

const double PI=acos(-1.0);

template<typename T>
inline T read(T&x){
    x=;int f=;char ch=getchar();
    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();
    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();
    return x=f?-x:x;
}

/*-----------------------showtime----------------------*/

            const int maxn = ;
            ll tree[maxn << ],add[maxn<<];
            int N = ,n,m;;
            void  build(){
                for(; N<=n+; N<<=);
                for(int i = N+; i<=N+n; i++)
                    scanf("%d", tree + i);
                for(int i = N-; i>=; i--)
                    tree[i] = tree[i<<] + tree[i<<|];
            }

            void update(int s,int t,int k){
                int lnum = ,rnum = ,num = ;
                for(s = N + s -, t = N + t + ; s ^ t ^ ; s>>=,t>>=,num<<=){
                    tree[s] += 1ll * k * lnum;
                    tree[t] += 1ll * k * rnum;

                    if(~s & ) {
                        add[s ^ ] += k;
                        tree[s^] += 1ll * k * num;
                        lnum += num;
                    }
                    if(t&) {
                        add[t^] += k;
                        tree[t^] += 1ll*k*num;
                        rnum += num;
                    }
                }
                for(; s; s>>=,t>>=){
                    tree[s] += 1ll*k * lnum;
                    tree[t] += 1ll * k * rnum;
                }
            }

            ll query(int s,int t){
                int lnum = ,rnum = ,num = ;
                ll ans = ;
                for(s=N+s-,t=N+t+; s ^ t ^ ; s>>=, t>>=, num<<=){
                    if(add[s]) ans += 1ll*add[s] * lnum;
                    if(add[t]) ans += 1ll*add[t] * rnum;

                    if(~s & ){ans += 1ll*tree[s^] ; lnum += num;}
                    if(t & ){ans += 1ll*tree[t ^ ]; rnum += num;}
                }

                for(; s;s>>=,t>>=){
                    ans += 1ll*add[s] * lnum;
                    ans += 1ll*add[t] * rnum;
                }
                return ans;
            }
int main(){

            scanf("%d%d", &n, &m);
            build();
            for(int i=; i<=m; i++){
                int op;
                scanf("%d", &op);
                if(op == ) {
                    int l,r,k;
                    scanf("%d%d%d", &l, &r, &k);
                    update(l,r,k);
                }
                else {
                    int l,r;
                    scanf("%d%d", &l, &r);
                    printf("%lld\n", query(l,r));
                }
            }
            return ;
}

ZKW