2019 ICPC 银川 G.Pot!!【线段树】

Link

前置

线段树的RMQ模板（区间查询，区间修改）

struct Tree{
	int tree[maxn*4],lazy[maxn*4];
	void push_up(int u){
		int v1=u*2,v2=u*2+1;
		tree[u]=max(tree[v1],tree[v2]);
	}
	void push_down(int u){
		int v1=u*2,v2=u*2+1;
		tree[v1]+=lazy[u];
		tree[v2]+=lazy[u];
		lazy[v1]+=lazy[u];
		lazy[v2]+=lazy[u];
		lazy[u]=0;
	}
	// 建树：整个区间，根节点 
	void build(int l,int r,int u){
		if(l==r){
			scanf("%lld",&tree[u]);
			return;
		}
		int m=(l+r)/2;
		int v1=u*2,v2=u*2+1;
		build(l,m,v1);
		build(m+1,r,v2);
		push_up(u);
	}
	// 区间修改：整个区间，询问区间，权值，根节点 
	void update(int l,int r,int L,int R,int val,int u){
		if(l>=L&&r<=R){
			lazy[u]+=val;
			tree[u]+=val;
			return;
		}
		push_down(u);
		int m=(l+r)/2;
		int v1=u*2,v2=u*2+1;
		if(L<=m) update(l,m,L,R,val,v1);
		if(R>m) update(m+1,r,L,R,val,v2);
		push_up(u);
	}
	// 区间查询：整个区间，询问区间，根节点 
	int query(int l,int r,int L,int R,int u){
		if(l>=L&&r<=R) return tree[u];
		push_down(u);
		int m=(l+r)/2;
		int v1=u*2,v2=u*2+1;
		int tmp=0;
		if(L<=m) tmp=max(tmp,query(l,m,L,R,v1));
		if(R>m) tmp=max(tmp,query(m+1,r,L,R,v2));
		return tmp;
	}
}tree;

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
const int maxn=1e5+5;
const int mod=1e9+7;
const int inf=1e18;
const int base=131;
const double pi=3.1415926;
#define ll long long
#define ull unsigned long long
#define maxx(a,b) (a>b?a:b)
#define minx(a,b) (a<b?a:b)
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(...) fprintf(stderr, __VA_ARGS__)
inline ll qpow(ll base, ll n) { assert(n >= 0); ll res = 1; while (n) { if (n & 1) res = res * base % mod; base = base * base % mod; n >>= 1; } return res; }
ll gcd(ll a,ll b) {return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b) { return a*b/gcd(a,b); }
ll inv(ll a) {return a == 1 ? 1 : (ll)(mod - mod / a) * inv(mod % a) % mod;}
ll C(ll n,ll m){if (m>n) return 0;ll ans = 1;for (int i = 1; i <= m; ++i) ans=ans*inv(i)%mod*(n-i+1)%mod;return ans%mod;}
ll A(ll n,ll m){ll sum=1; for(int i=n;i>=n-m+1;i--) sum=(sum*i)%mod; return sum%mod;}
ll GetSum(ll L, ll R) {return (R - L + 1ll) * (L + R) / 2ll;} //等差数列求和 
 
/************/
int n,q;
int tree[maxn*4][10],lazy[maxn*4][10];
//tree[u][p]:维护u结点质数p出现的次数
void push_up(int p,int u){
	int v1=u*2,v2=u*2+1;
	tree[u][p]=max(tree[v1][p],tree[v2][p]);
}
void push_down(int p,int u){
	int v1=u*2,v2=u*2+1;
	tree[v1][p]+=lazy[u][p];
	tree[v2][p]+=lazy[u][p];
	lazy[v1][p]+=lazy[u][p];
	lazy[v2][p]+=lazy[u][p];
	lazy[u][p]=0;
}
void update(int l,int r,int L,int R,int p,int u){
	if(l>=L&&r<=R){
		tree[u][p]++;
		lazy[u][p]++;
		return;
	}
	push_down(p,u);
	int m=(l+r)/2;
	int v1=u*2,v2=u*2+1;
	if(L<=m) update(l,m,L,R,p,v1);
	if(R>m) update(m+1,r,L,R,p,v2);
	push_up(p,u);
}
int query(int l,int r,int L,int R,int p,int u){
	if(l>=L&&r<=R) return tree[u][p];
	push_down(p,u);
	int m=(l+r)/2;
	int v1=u*2,v2=u*2+1;
	int tmp=0;
	if(L<=m) tmp=max(tmp,query(l,m,L,R,p,v1));
	if(R>m) tmp=max(tmp,query(m+1,r,L,R,p,v2));
	return tmp;
}
void add(int l,int r,int x){
	for(int i=2;i*i<=x;i++){
		while(x%i==0){
			update(1,n+1,l,r,i,1);
			x/=i;
		}
	}
	if(x>1) update(1,n+1,l,r,x,1);
}
signed main()
{
	scanf("%lld%lld",&n,&q);
	for(int i=0;i<q;i++){
		char a[15];
		scanf("%s",a);
		if(a[1]=='U'){
			int L,R,x;
			scanf("%lld%lld%lld",&L,&R,&x);
			add(L,R,x);
		}
		else{
			int L,R;
			scanf("%lld%lld",&L,&R);
			int ans=0;
			for(int i=2;i<10;i++) ans=max(ans,query(1,n+1,L,R,i,1));
			printf("ANSWER %lld\n",ans);
		}
	}
	return 0;
}