Interval GCD [树状数组+线段树]

 传送门

题解原网 ---- gsj 巨神学长 https://blog.csdn.net/forever_dreams/article/details/85222870

#include<bits/stdc++.h>
#define N 500051
#define LL long long
using namespace std;
struct Node{int l,r; LL val;}t[N<<2];
LL c[N],a[N]; int n,m;
void Insert(int x,LL val){for(;x<=n;x+=x&-x) c[x] += val;}
LL Sum(int x){LL ans=0; for(;x;x-=x&-x) ans += c[x]; return ans;} 
LL gcd(LL a,LL b){return !b?a:gcd(b,a%b);}
void Pushup(int x){
	t[x].val = gcd(t[x<<1].val,t[x<<1|1].val);
}
void build(int x,int l,int r){
	t[x].l = l,t[x].r = r;
	if(l==r){ t[x].val = a[l]-a[l-1]; return;}
	int mid = (l+r)>>1; build(x<<1,l,mid),build(x<<1|1,mid+1,r);
	Pushup(x);
}
void Update(int x,int pos,LL val){
	if(t[x].l == t[x].r){t[x].val+=val; return;}
	int mid = (t[x].l+t[x].r)>>1;
	if(pos<=mid) Update(x<<1,pos,val);
	else Update(x<<1|1,pos,val); 
	Pushup(x);
}
LL Quary(int x,int L,int R){
	if(L<=t[x].l && t[x].r<=R){
		return t[x].val;
	}
	int mid = (t[x].l+t[x].r)>>1;
	if(L>mid) return Quary(x<<1|1,L,R);
	if(R<=mid) return Quary(x<<1,L,R);
	return gcd(Quary(x<<1|1,L,R),Quary(x<<1,L,R));
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]); 
	} build(1,1,n);
	for(int i=1;i<=m;i++){
		char s[3]; int x,y;
		scanf("%s%d%d",s,&x,&y);
		if(s[0]=='C'){
			LL val; scanf("%lld",&val);
			Update(1,x,val),Insert(x,val); 
			if(y+1<=n) Insert(y+1,-val),Update(1,y+1,-val);
		}
		else{
			LL g1 = Sum(x)+a[x]; LL g2 = Quary(1,x+1,y);
			printf("%lld\n",abs(gcd(g1,g2)));
		}
	}return 0;
}