数据结构模板

线段树

函数名要写上。。。
LL 在运算的时候要防溢出。

#include <iostream>#include <cstdio>#include <algorithm>#include <cstdlib>#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;const int MAXN=100005;long long  sum[MAXN<<2];long long col[MAXN<<2];long long read(){    long long rv=0,fh=1;    char c=getchar();    while(c<'0'||c>'9'){        if(c=='-') fh=-1;        c=getchar();    }    while(c>='0'&&c<='9'){        rv=(rv<<1)+(rv<<3)+c-'0';        c=getchar();    }    return rv*fh;}void PushUP(int rt){    sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void PushDown(int rt,int m){    if(col[rt]){        col[rt<<1]+=col[rt];        col[rt<<1|1]+=col[rt];        sum[rt<<1]+=col[rt]*(m-(m>>1));   //        sum[rt<<1|1]+=col[rt]*(m>>1);        col[rt]=0;    }}void build(int l,int r,int rt){    col[rt]=0;    if(l==r) {sum[rt]=read();/*scanf("%lld",&sum[rt]);*/return ;}    int m=(l+r)>>1;    build(lson);    build(rson);    PushUP(rt);}/*void update(int p,int add,int l,int r,int rt){    if(l==r){        sum[rt]+=add;        return ;    }    int m=(l+r)>>1;    if(p<=m) update(lson);    else update(rson);    PushUP(rt);}int query(int L,int R,int l,int r,int rt){    if(L<=l&&r<=R) {        return sum[rt];    }    int m=(l+r)>>1;    int ret=0;    if(L<=m) ret+=(L,R,lson);    if(R>m) ret+=(L,R,rson);    return ret;}*/void update(int L,int R,int add,int l,int r,int rt){    if(L<=l&&r<=R){        col[rt]+=add;        sum[rt]+=(long long)add*(r-l+1);        return ;    }    PushDown(rt,r-l+1);    int m=(l+r)>>1;    if(L<=m) update(L,R,add,lson);    if(m<R) update(L,R,add,rson);    PushUP(rt);}long long 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;      long long ret = 0;    if(L<=m) ret += query(L , R , lson);     if(m<R) ret+=query(L,R,rson);    return ret;}int n,m;int main(){    freopen("in.txt","r",stdin);    n=read();m=read();    //scanf("%d%d",&n,&m);    build(1,n,1);    for(int i=1;i<=m;i++){        int t;        scanf("%d",&t);        int l,r,add;        if(t==1){            l=read();r=read();add=read();            //scanf("%d%d%d",&l,&r,&add);            update(l,r,add,1,n,1);        }else {            l=read();r=read();            //scanf("%d%d",&l,&r);            printf("%lld\n",query(l,r,1,n,1));        }    }       fclose(stdin);    return 0;}

区间加，区间乘，取模

ATTENTION:凡是能取模的地方都要取模，防溢出。


#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <cmath>#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define LL long long using namespace std;const int MAXN=100005;LL init(){LL rv=0,fh=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-') fh=-1;c=getchar();}while(c>='0'&&c<='9'){rv=(rv<<1)+(rv<<3)+c-'0';c=getchar();}return rv*fh;}LL sum[MAXN<<2],col[MAXN<<2],mul[MAXN<<2],n,num,MOD;void Pushup(int rt){sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void Pushdown(int rt,int m){if(mul[rt]!=1){mul[rt<<1]*=mul[rt];mul[rt<<1]%=MOD;mul[rt<<1|1]*=mul[rt];mul[rt<<1|1]%=MOD;sum[rt<<1]*=mul[rt];sum[rt<<1]%=MOD;sum[rt<<1|1]*=mul[rt];sum[rt<<1|1]%=MOD;col[rt<<1]*=mul[rt];col[rt<<1]%=MOD;col[rt<<1|1]*=mul[rt];col[rt<<1|1]%=MOD;mul[rt]=1;}if(col[rt]){col[rt<<1]+=col[rt];col[rt<<1]%=MOD;col[rt<<1|1]+=col[rt];col[rt<<1|1]%=MOD;sum[rt<<1]+=col[rt]*(m-(m>>1));sum[rt<<1]%=MOD;sum[rt<<1|1]+=col[rt]*(m>>1);sum[rt<<1|1]%=MOD;col[rt]=0;}}void build(int l,int r,int rt){mul[rt]=1;if(l==r){sum[rt]=init()%MOD;return;}int m=(l+r)>>1;build(lson);build(rson);Pushup(rt);}void update(int L,int R,int add,int l,int r,int rt,bool op){if(L<=l&&r<=R){if(!op){sum[rt]+=(LL)add*(r-l+1);sum[rt]%=MOD;col[rt]+=add;col[rt]%=MOD;}else{sum[rt]*=add;sum[rt]%=MOD;mul[rt]*=add;mul[rt]%=MOD;col[rt]*=add;col[rt]%=MOD;}return;}Pushdown(rt,r-l+1);int m=(l+r)>>1;if(L<=m) update(L,R,add,lson,op);if(m<R) update(L,R,add,rson,op);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);LL ret=0;int m=(l+r)>>1;if(L<=m) ret+=query(L,R,lson);if(m<R) ret+=query(L,R,rson);return ret%MOD;}int main(){freopen("in.txt","r",stdin);n=init();num=init();MOD=init();build(1,n,1);for(int i=1;i<=num;i++){int t=init();if(t==1){int l=init(),r=init(),add=init();update(l,r,add,1,n,1,1);}else if(t==2){int l=init(),r=init(),add=init();update(l,r,add,1,n,1,0);}else{int l=init(),r=init();printf("%lld\n",query(l,r,1,n,1));}}fclose(stdin);return 0;}