洛谷 P3372 【模板】线段树 1 题解

Analysis

新学了一种很骚气的线段树写法，就是把整个线段树放到一个struct里面，然后可以直接调用里面的函数

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #define int long long
 #define maxn 100010
 using namespace std;
 inline int read()
 {
     int x=;
     bool f=;
     char c=getchar();
     for(; !isdigit(c); c=getchar()) if(c=='-') f=;
     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';
     if(f) return x;
     return -x;
 }
 inline void write(int x)
 {
     if(x<){putchar('-');x=-x;}
     if(x>)write(x/);
     putchar(x%+'');
 }
 int n,m,a[maxn];
 struct Segment_tree
 {
     struct Segment_tree_node
     {
         int l,r,val,tag;
     }node[maxn*];
     int n;
     inline int size() {return n;}
     inline int left_s(int x) {return (x<<);}
     inline int right_s(int x) {return ((x<<)|);}
     inline void calc(int x,int y)
     {
         node[x].tag+=y;
         node[x].val+=y*(node[x].r-node[x].l+);
     }
     inline void push_up(int x)
     {
         node[x].val=node[left_s(x)].val+node[right_s(x)].val;
     }
     inline void push_down(int x)
     {
         calc(left_s(x),node[x].tag);
         calc(right_s(x),node[x].tag);
         node[x].tag=;
     }
     inline void build(int x)
     {
         node[x].tag=;
         if(node[x].l==node[x].r)
         {
             node[x].val=a[node[x].l];
             return;
         }
         int mid=(node[x].l+node[x].r)>>;
         node[left_s(x)].l=node[x].l;
         node[left_s(x)].r=mid;
         build(left_s(x));
         node[right_s(x)].l=mid+;
         node[right_s(x)].r=node[x].r;
         build(right_s(x));
         push_up(x);
     }
     inline void init(int l,int r)
     {
         n=r-l+;
         node[].l=;
         node[].r=n;
         build();
     }
     inline void update(int x,int l,int r,int v)
     {
         if(l<=node[x].l&&node[x].r<=r)
         {
             calc(x,v);
             return;
         }
         push_down(x);
         if(l<=node[left_s(x)].r) update(left_s(x),l,r,v);
         if(node[right_s(x)].l<=r) update(right_s(x),l,r,v);
         push_up(x);
      }
      inline int query(int x,int l,int r)
      {
          if(l<=node[x].l&&node[x].r<=r) return node[x].val;
          push_down(x);
          int ans=;
          if(l<=node[left_s(x)].r)ans+=query(left_s(x),l,r);
          if(node[right_s(x)].l<=r)ans+=query(right_s(x),l,r);
          return ans;
      }
 }t;
 signed main()
 {
     n=read();m=read();
     for(int i=;i<=n;i++) a[i]=read();
     t.init(,n);
     for(int i=;i<=m;i++)
     {
         int x=read();
         if(x==)
         {
             int x=read(),y=read(),z=read();
             t.update(,x,y,z);
         }
         else if(x==)
         {
             int x=read(),y=read();
             write(t.query(,x,y));
             printf("\n");
         }
     }
     return ;
 }

请各位大佬斧正（反正我不认识斧正是什么意思）