单标记(区间维护)
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define maxn 111111
using namespace std;
LL sum[maxn<<2];
LL add[maxn<<2];
void PushUp(int rt)
{
sum[rt] = sum[rt << 1] + sum[rt<<1|1];
}
void pushdown(int rt,int m)
{
if(add[rt])
{
add[rt<<1]+=add[rt];
add[rt<<1|1]+=add[rt];
sum[rt<<1]+=(m-(m>>1))*add[rt];
sum[rt<<1|1]+=(m>>1)*add[rt];
add[rt]=0;
}
}
void build(int l, int r, int rt)//建立线段树
{
add[rt]=0;
if (l == r)
{
scanf("%I64d", &sum[rt]);
return;
}
int m = (l + r) >> 1;
build(lson);
build(rson);
PushUp(rt);
}
void update(int L, int R,int c, int l, int r, int rt)
{
if(L<=l&&R>=r)
{
add[rt]+=c;
sum[rt]+=(LL)c*(r-l+1);
return ;
}
pushdown(rt,r-l+1);
int m=(r+l)>>1;
if(L<=m)
update(L,R,c,lson);
if(R>m)
update(L,R,c,rson);
PushUp(rt);
}
LL query(int L, int R, int l, int r, int rt)//查询线段树
{
if (L <= l && R>= r) return sum[rt];
pushdown(rt,r-l+1);
int m = (l + r) >> 1;
LL ret = 0;
if (L<=m) ret += query(L, R, lson);
if (R>m) ret += query(L, R, rson);
return ret;
}
双标记(区间乘和加注意标记的顺序和处理)
<pre class="sh-cpp sh-sourceCode" style="font-family: Courier New,Courier,monospace;"><pre name="code" class="cpp">#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define maxn 100010
using namespace std;
LL sum[maxn<<2];
LL add[maxn<<2];
LL mul[maxn<<2];
LL mod;
void PushUp(int rt)//向上更新
{
sum[rt] = (sum[rt << 1] + sum[rt<<1|1])%mod;
}
void pushdown(int rt,int m)//向下更新
{
if(m==1)
return;
sum[rt<<1]=(mul[rt]*sum[rt<<1]%mod+add[rt]*(m-(m>>1))%mod)%mod;
sum[rt<<1|1]=(mul[rt]*sum[rt<<1|1]%mod+add[rt]*(m>>1)%mod)%mod;
add[rt<<1]=(add[rt<<1]*mul[rt]%mod+add[rt])%mod;
add[rt<<1|1]=(add[rt<<1|1]*mul[rt]%mod+add[rt])%mod;
mul[rt<<1]=mul[rt<<1]*mul[rt]%mod;
mul[rt<<1|1]=mul[rt<<1|1]*mul[rt]%mod;
add[rt]=0;
mul[rt]=1;
}
void build(int l, int r, int rt)//建立线段树
{
add[rt]=0;
mul[rt]=1;
if (l == r)
{
scanf("%I64d", &sum[rt]);
sum[rt]=sum[rt]%mod;
return;
}
int m = (l + r) >> 1;
build(lson);
build(rson);
PushUp(rt);
}
void update(int L, int R,int c,int cc, int l, int r, int rt)
{
pushdown(rt,r-l+1);
if(L<=l&&R>=r)
{
sum[rt]=(sum[rt]*c%mod+(r-l+1)*cc)%mod;
mul[rt]=mul[rt]*c%mod;
add[rt]=(add[rt]*c%mod+cc)%mod;
return ;
}
int m=(r+l)>>1;
if(L<=m)
update(L,R,c,cc,lson);
if(R>m)
update(L,R,c,cc,rson);
PushUp(rt);
}
LL query(int L, int R, int l, int r, int rt)//查询线段树
{
if (L <= l && R>= r) return sum[rt];
pushdown(rt,r-l+1);
int m = (l + r) >> 1;
LL ret = 0;
if (L<=m) ret = (ret+query(L, R, lson)%mod);
if (R>m) ret = ret+query(L, R, rson)%mod;
return ret%mod;
}