传送梦:
P3373 【模板】线段树 2 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)https://www.luogu.com.cn/problem/P3373
这道题依然是个模板题,相比于线段树1,多了一个操作(乘法操作),那么懒人标记会多一个,我们记乘法为mark1[],加法为mark2[]。那么两个懒人标记如何处理呢,我们都可以想到乘法优先级大于加法,于是就可以想出来怎么处理了(当然,思考和debug过程非常痛苦)。
这里先给出我模板1的传送门:
(74条消息) P3372【模板】线段树1-洛谷-java题解-线段树_17号列车的博客-CSDN博客https://blog.csdn.net/weixin_58428691/article/details/123521469?spm=1001.2014.3001.5501 对于push_down操作,因为有两个懒人标记(mark1和mark2),写法当然会变化。
假设当前树的位置为p,由于加法对乘法没有影响,那么子树值求解如下:
tree[p<<1] = (mark1[p]*tree[p<<1] + mark2[p]*(m-l+1))%z;
tree[p<<1|1] = (mark1[p]*tree[p<<1|1] + mark2[p]*(r-m))%z;
//tree[p<<1]为左子树,tree[p<<1|1]为右子树
//mark1为乘法标记,mark2为加法标记
那么子树的乘法标记直接乘上父的乘法标记:
mark1[p<<1] =mark1[p<<1]*mark1[p]%z;
mark1[p<<1|1] = mark1[p<<1|1]*mark1[p]%z;
子树的加法标记就不是简单的相加了,由于乘法对加法是有影响的,所以:
mark2[p<<1] = (mark2[p<<1]*mark1[p] + mark2[p])%z;
mark2[p<<1|1] = (mark2[p<<1|1]*mark1[p] + mark2[p])%z;
最后,别忘了mark标记重置
mark1[p] = 1;//乘法标记
mark2[p] = 0;//加法标记
操作二加法(update2)不变,加法不影响乘法:
private static void update2(int l,int r,int d,int p,int ll,int rr){
//加法
if(l<=ll&&rr<=r){
tree[p] = (tree[p]+d*(rr-ll+1))%z;
mark2[p]=(mark2[p]+d)%z;
return;
}
push_down(p,ll,rr);
int m = ll + ((rr-ll)>>1);
if(l<=m) update2(l,r,d,p<<1,ll,m);
if(r>m) update2(l,r,d,p<<1|1,m+1,rr);
tree[p] = (tree[p<<1] + tree[p<<1|1])%z;
}
操作二乘法(update1) 小变化,乘法标记乘了一个数后,加法标记也做相同操作
private static void update1(int l,int r,int d,int p,int ll,int rr){
if(l<=ll&&rr<=r){
tree[p] = tree[p]*d%z;
mark1[p]=mark1[p]*d%z;
mark2[p]=mark2[p]*d%z;return;
}
push_down(p,ll,rr);
int m = ll + ((rr-ll)>>1);
if(l<=m) update1(l,r,d,p<<1,ll,m);
if(r>m) update1(l,r,d,p<<1|1,m+1,rr);
tree[p] = (tree[p<<1] + tree[p<<1|1])%z;
}
不要忘了对乘法标记初始化,可以在建树时初始化 :
private static void build(int l,int r,int p){
mark1[p]=1;//初始化qwq
if(l==r) {
tree[p] = A[l];
return;
}
int m = l + ((r-l)>>1);
build(l,m,p<<1);
build(m+1,r,p<<1|1);
tree[p] = (tree[p<<1] + tree[p<<1|1])%z;
}
完整AC代码:
import java.io.*;
import java.util.*;
public class Main {
static long[] tree = new long[100000<<2], mark1 = new long[100000<<2],mark2 = new long[100000<<2];
static int[] A;
static int z;
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StreamTokenizer st = new StreamTokenizer(br);
PrintWriter pr = new PrintWriter(System.out);
//数据输入
st.nextToken();int n = (int)st.nval;
st.nextToken();int m = (int)st.nval;
st.nextToken();z = (int)st.nval;
A = new int[n+1];
for(int i=1;i<=n;i++){
st.nextToken();A[i] = (int)st.nval;
}
build(1,n,1);
for(int i=1;i<=m;i++){
st.nextToken();int t = (int)st.nval;
st.nextToken();int x = (int)st.nval;
st.nextToken();int y = (int)st.nval;
if(t==1){
st.nextToken();int k = (int)st.nval;
update1(x,y,k,1,1,n);
} else if(t==2) {
st.nextToken();int k = (int)st.nval;
update2(x,y,k,1,1,n);
} else {
pr.println(query(x,y,1,1,n));
}
}
pr.flush();
}
private static void push_down(int p,int l,int r){
if(l==r)return;
int m = l + ((r-l)>>1);
tree[p<<1] = (mark1[p]*tree[p<<1] + mark2[p]*(m-l+1))%z;
tree[p<<1|1] = (mark1[p]*tree[p<<1|1] + mark2[p]*(r-m))%z;
mark1[p<<1] =mark1[p<<1]*mark1[p]%z;
mark1[p<<1|1] = mark1[p<<1|1]*mark1[p]%z;
mark2[p<<1] = (mark2[p<<1]*mark1[p] + mark2[p])%z;
mark2[p<<1|1] = (mark2[p<<1|1]*mark1[p] + mark2[p])%z;
mark1[p] = 1;mark2[p] = 0;
}
private static void build(int l,int r,int p){
mark1[p]=1;
if(l==r) {
tree[p] = A[l];
return;
}
int m = l + ((r-l)>>1);
build(l,m,p<<1);
build(m+1,r,p<<1|1);
tree[p] = (tree[p<<1] + tree[p<<1|1])%z;
}
private static void update1(int l,int r,int d,int p,int ll,int rr){
if(l<=ll&&rr<=r){
tree[p] = tree[p]*d%z;
mark1[p]=mark1[p]*d%z;
mark2[p]=mark2[p]*d%z;return;
}
push_down(p,ll,rr);
int m = ll + ((rr-ll)>>1);
if(l<=m) update1(l,r,d,p<<1,ll,m);
if(r>m) update1(l,r,d,p<<1|1,m+1,rr);
tree[p] = (tree[p<<1] + tree[p<<1|1])%z;
}
private static void update2(int l,int r,int d,int p,int ll,int rr){
//加法
if(l<=ll&&rr<=r){
tree[p] = (tree[p]+d*(rr-ll+1))%z;
mark2[p]=(mark2[p]+d)%z;
return;
}
push_down(p,ll,rr);
int m = ll + ((rr-ll)>>1);
if(l<=m) update2(l,r,d,p<<1,ll,m);
if(r>m) update2(l,r,d,p<<1|1,m+1,rr);
tree[p] = (tree[p<<1] + tree[p<<1|1])%z;
}
private static long query(int l,int r,int p,int ll,int rr){
if(l<=ll&&rr<=r)return tree[p];
push_down(p,ll,rr);
int m = ll + ((rr-ll)>>1);long ans = 0;
if(l<=m) ans += query(l,r,p<<1,ll,m);
if(r>m) ans += query(l,r,p<<1|1,m+1,rr);
return ans%z;
}
}