线段树区间更新 lazy

1.

hdu1698

http://acm.hdu.edu.cn/showproblem.php?pid=1698

 /*
 x y k
 x~y的值变为k
 */
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <cstring>
 #include <time.h>
 #include <string>
 #include <set>
 #include <map>
 #include <list>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <bitset>
 #include <ext/rope>
 #include <algorithm>
 #include <iostream>
 using namespace std;
 #define ll long long
 #define minv 1e-6
 #define inf 1e9
 #define pi 3.1415926536
 #define E  2.7182818284
 const ll mod=1e9+;//
 const int maxn=1e5+;

 int tag[maxn<<],sum[maxn<<];

 void push_down(int index,int len)
 {
     tag[index<<]=tag[index<<|]=tag[index];
     sum[index<<]=((len+)>>)*tag[index];
     sum[index<<|]=(len>>)*tag[index];
     tag[index]=;
 }

 void build(int index,int l,int r)
 {
     tag[index]=;
     if (l==r)
         sum[index]=;
     else
     {
         int m=(l+r)>>;
         build(index<<,l,m);
         build(index<<|,m+,r);
         sum[index]=sum[index<<]+sum[index<<|];
     }
 }

 void update(int index,int l,int r,int x,int y,int k)
 {
     if (x<=l && r<=y)
     {
         tag[index]=k;
         sum[index]=(r-l+)*k;
         return;
     }
     if (tag[index]!=)
         push_down(index,r-l+);
     int m=(l+r)>>;
     if (x<=m)
         update(index<<,l,m,x,y,k);
     if (m<y)
         update(index<<|,m+,r,x,y,k);
     sum[index]=sum[index<<]+sum[index<<|];
 }

 int query(int index,int l,int r,int s,int t)
 {
     if (s<=l && r<=t)
         return sum[index];
     if (r<s || l>t)
         return ;
     if (tag[index]!=)
         push_down(index,r-l+);
     int m=(l+r)>>;
     return query(index<<,l,m,s,t)+query(index<<|,m+,r,s,t);
 }

 int main()
 {
     int t,T,n,q,x,y,k;
     scanf("%d",&t);
     for (T=;T<=t;T++)
     {
         scanf("%d",&n);
         build(,,n);
         scanf("%d",&q);
         while (q--)
         {
             scanf("%d%d%d",&x,&y,&k);
             update(,,n,x,y,k);
         }
         printf("Case %d: The total value of the hook is %d.\n",T,query(,,n,,n));
     }
     return ;
 }

2.

https://www.luogu.org/problemnew/show/P3372

不用取余

 /*

 操作1： 格式：1 x y k 含义：将区间[x,y]内每个数加上k

 操作2： 格式：2 x y 含义：输出区间[x,y]内每个数的和
 */
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <cstring>
 #include <time.h>
 #include <string>
 #include <set>
 #include <map>
 #include <list>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <bitset>
 #include <ext/rope>
 #include <algorithm>
 #include <iostream>
 using namespace std;
 #define ll long long
 #define minv 1e-6
 #define inf 1e9
 #define pi 3.1415926536
 #define E  2.7182818284
 const ll mod=1e9+;//
 const int maxn=1e5+;

 ll sum[maxn<<],tag[maxn<<];

 void build(int index,int l,int r)
 {
     tag[index]=;
     if (l==r)
     {
         scanf("%lld",&sum[index]);
         sum[index]=sum[index];
     }
     else
     {
         int m=(l+r)>>;
         build(index<<,l,m);
         build(index<<|,m+,r);
         sum[index]=sum[index<<]+sum[index<<|];
     }
 }

 void pushdown(int index,ll len)
 {
     sum[index<<]=tag[index]*((len+)>>) +sum[index<<];
     sum[index<<|]=tag[index]*(len>>) +sum[index<<|];
     tag[index<<]=tag[index]+ tag[index<<];
     tag[index<<|]=tag[index]+ tag[index<<|];
     tag[index]=;
 }

 void update(int index,int l,int r,int x,int y,ll k)
 {
     if (x<=l && r<=y)
     {
         sum[index]=k*(r-l+) +sum[index];
         tag[index]=k +tag[index];
         return;
     }
     int m=(l+r)>>;
     if (tag[index]!=)
         pushdown(index,r-l+);
     if (x<=m)
         update(index<<,l,m,x,y,k);
     if (m<y)
         update(index<<|,m+,r,x,y,k);
     sum[index]=sum[index<<]+sum[index<<|];
 }

 ll query(int index,int l,int r,int x,int y)
 {
     if (x<=l && r<=y)
         return sum[index];
     if (r<x || l>y)
         return ;
     if (tag[index]!=)
         pushdown(index,r-l+);
     int m=(l+r)>>;
     return query(index<<,l,m,x,y)+query(index<<|,m+,r,x,y);
 }

 int main()
 {
     int n,m,mode,x,y;
     ll k;
     scanf("%d%d",&n,&m);
     build(,,n);
     while (m--)
     {
         scanf("%d",&mode);
         if (mode==)
         {
             scanf("%d%d%lld",&x,&y,&k);
             update(,,n,x,y,k);
         }
         else
         {
             scanf("%d%d",&x,&y);
             printf("%lld\n",query(,,n,x,y));
         }
     }
     return ;
 }
 /*
 10
 463 793 740 374 330 772 681
 5 8 39
 5 8
 3 6 3
 5 8 90
 1 5 21
 3 8
 3 8 17
 4 7 52
 2 6
 2 7 41
 5
 2 3 4 5
 1 3 -1
 1 3 1
 2 4
 100
 2 3 4 5 6 7 8 9 10
 1 10
 2 7 1
 1 10
 3 8

 */

3.

https://www.luogu.org/problemnew/show/P3373

 /*
 1.将某区间每一个数乘上x

 2.将某区间每一个数加上x

 3.求出某区间每一个数的和
 */
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <cstring>
 #include <time.h>
 #include <string>
 #include <set>
 #include <map>
 #include <list>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <bitset>
 #include <ext/rope>
 #include <algorithm>
 #include <iostream>
 using namespace std;
 #define ll long long
 #define minv 1e-6
 #define inf 1e9
 #define pi 3.1415926536
 #define E  2.7182818284
 //const ll mod=1e9+7;//
 const int maxn=1e5+;

 ll mod;
 ll add[maxn<<],mul[maxn<<],sum[maxn<<];
 int mode;

 void build(int index,int l,int r)
 {
     add[index]=;
     mul[index]=;
     if (l==r)
     {
         scanf("%lld",&sum[index]);
         sum[index]=sum[index]%mod;
     }
     else
     {
         int m=(l+r)>>;
         build(index<<,l,m);
         build(index<<|,m+,r);
         sum[index]=(sum[index<<]+sum[index<<|])%mod;
     }
 }

 void pushdown(int index,ll len)
 {
     //(x *y+z)*s+t = x*(ys) + z*s+t
     add[index<<]=(add[index<<]*mul[index]+add[index])%mod;
     mul[index<<]=mul[index]*mul[index<<]%mod;
     sum[index<<]=(sum[index<<]*mul[index]+add[index]*((len+)>>))%mod;

     add[index<<|]=(add[index<<|]*mul[index]+add[index])%mod;
     mul[index<<|]=mul[index]*mul[index<<|]%mod;
     sum[index<<|]=(sum[index<<|]*mul[index]+add[index]*(len>>))%mod;

     add[index]=;
     mul[index]=;
 }

 void update(int index,int l,int r,int x,int y,ll k)
 {
     if (x<=l && r<=y)
     {
         if (mode==)
         {
             //(x*y+z)*k
             sum[index]=sum[index]*k%mod;
             add[index]=add[index]*k%mod;
             mul[index]=mul[index]*k%mod;
         }
         else
         {
             //(x*y+z)+k
             sum[index]=(sum[index]+k*(r-l+))%mod;
             add[index]=(add[index]+k)%mod;
         }
         return;
     }
     pushdown(index,r-l+);
     int m=(l+r)>>;
     if (x<=m)
         update(index<<,l,m,x,y,k);
     if (m<y)
         update(index<<|,m+,r,x,y,k);
     sum[index]=(sum[index<<]+sum[index<<|])%mod;
 }

 ll query(int index,int l,int r,int x,int y)
 {
     if (x<=l && r<=y)
         return sum[index];
     if (x>r || y<l)
         return ;
     pushdown(index,r-l+);
     int m=(l+r)>>;
     return (query(index<<,l,m,x,y)+query(index<<|,m+,r,x,y))%mod;
 }

 int main()
 {
     int n,q,x,y;
     ll k;
     scanf("%d%d%lld",&n,&q,&mod);
     build(,,n);
     while (q--)
     {
         scanf("%d%d%d",&mode,&x,&y);
         if (mode!=)
         {
             scanf("%lld",&k);
             update(,,n,x,y,k%mod);
         }
         else
             printf("%lld\n",query(,,n,x,y));
     }
     return ;
 }
 /*
 5 100 1000000
 1 2 3 4 5
 1 1 5 2
 2 1 5 3
 3 1 3

 */