UPD BZOJ 1798: [Ahoi2009]Seq 维护序列seq

原文地址：http://blog.csdn.net/charlie_pyc/article/details/19482769

Update Code:

/*
 * Problem:1798
 * Author:PYC
 */

#include <cstdio>

#define maxn 100000

using namespace std;

int n,p,a[maxn+1];
long long sum[maxn*4],_plus[maxn*4],_mul[maxn*4];

inline void up(int k){sum[k]=(sum[k*2]+sum[k*2+1])%p;}

inline void down(int k,int len1,int len2){
	if (_mul[k]>=0){
		if (_mul[k*2]>=0) _mul[k*2]=(_mul[k*2]*_mul[k])%p;else _mul[k*2]=_mul[k]%p;
		if (_mul[k*2+1]>=0) _mul[k*2+1]=(_mul[k*2+1]*_mul[k])%p;else _mul[k*2+1]=_mul[k]%p;
		_plus[k*2]=(_plus[k*2]*_mul[k])%p;
		_plus[k*2+1]=(_plus[k*2+1]*_mul[k])%p;
		sum[k*2]=(sum[k*2]*_mul[k])%p;
		sum[k*2+1]=(sum[k*2+1]*_mul[k])%p;
		_mul[k]=-1;
	}
	if (_plus[k]){
		_plus[k*2]=(_plus[k*2]+_plus[k])%p;
		_plus[k*2+1]=(_plus[k*2+1]+_plus[k])%p;
		sum[k*2]=(sum[k*2]+_plus[k]*len1%p)%p;
		sum[k*2+1]=(sum[k*2+1]+_plus[k]*len2%p)%p;
		_plus[k]=0;
	}
}

void build(int k,int lc,int rc){
	if (lc==rc){sum[k]=a[lc]%p;_mul[k]=-1;return;}
	int mid=(lc+rc)/2;
	build(k*2,lc,mid);
	build(k*2+1,mid+1,rc);
	up(k);
	_mul[k]=-1;
}

void plus(int k,int lc,int rc,int l,int r,int d){
	if (lc==l && rc==r){sum[k]=(sum[k]+(r-l+1)*d%p)%p;_plus[k]=(_plus[k]+d)%p;return;}
	int mid=(lc+rc)/2;
	down(k,mid-lc+1,rc-mid);
	if (r<=mid) plus(k*2,lc,mid,l,r,d);
	else if (l>mid) plus(k*2+1,mid+1,rc,l,r,d);
	else{plus(k*2,lc,mid,l,mid,d);plus(k*2+1,mid+1,rc,mid+1,r,d);}
	up(k);
}

void mul(int k,int lc,int rc,int l,int r,int d){
	if (lc==l && rc==r){
		_plus[k]=(_plus[k]*d)%p;
		sum[k]=(sum[k]*d)%p;
		if (_mul[k]>=0) _mul[k]=(_mul[k]*d)%p;else _mul[k]=d%p;
		return;
	}
	int mid=(lc+rc)/2;
	down(k,mid-lc+1,rc-mid);
	if (r<=mid) mul(k*2,lc,mid,l,r,d);
	else if (l>mid) mul(k*2+1,mid+1,rc,l,r,d);
	else{mul(k*2,lc,mid,l,mid,d);mul(k*2+1,mid+1,rc,mid+1,r,d);}
	up(k);
}

long long ask(int k,int lc,int rc,int l,int r){
	if (lc==l && rc==r) return sum[k]%p;
	int mid=(lc+rc)/2;
	down(k,mid-lc+1,rc-mid);
	if (r<=mid) return ask(k*2,lc,mid,l,r);
	if (l>mid) return ask(k*2+1,mid+1,rc,l,r);
	return (ask(k*2,lc,mid,l,mid)+ask(k*2+1,mid+1,rc,mid+1,r))%p;
	up(k);
}

int main(){
	scanf("%d%d",&n,&p);
	for (int i=1;i<=n;++i) scanf("%d",&a[i]);
	build(1,1,n);
	int m;
	scanf("%d",&m);
	for (int i=1;i<=m;++i){
		int x;
		scanf("%d",&x);
		if (x==1){
			int l,r,d;
			scanf("%d%d%d",&l,&r,&d);
			mul(1,1,n,l,r,d);
		}
		if (x==2){
			int l,r,d;
			scanf("%d%d%d",&l,&r,&d);
			plus(1,1,n,l,r,d);
		}
		if (x==3){
			int l,r;
			scanf("%d%d",&l,&r);
			printf("%lld\n",ask(1,1,n,l,r));
		}
	}
	return 0;
}

By Charlie Pan

Mar 10,2014