小阳的贝壳（思维 + 差分 + 线段树）

题目链接

分析

这个题好,原题是acwing的这个题:
https://www.acwing.com/activity/content/code/content/1653955/

维护三个东西就行:
差分数组最大值, 差分数组总和, 差分的gcd

麻了，wa了好久…
注意l=r的时候要特判，不然query的时候就会SE！！！
因为l+1 > r 了

代码

#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
 
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
  
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)

typedef long long ll;
typedef unsigned long long ull;
      
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
 
const int maxn = 1e5 + 7;
const int N = 2010 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
// const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
  
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 qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}

int a[maxn];
int d[maxn];

struct node
{
	int l,r;
	int sum,g,mx;
}tr[maxn*4];

int n,m;

void pushup(node &u,node &l_u,node &r_u)
{
	u.mx = max(l_u.mx,r_u.mx);
    u.sum = l_u.sum + r_u.sum;
    u.g = __gcd(l_u.g , r_u.g);
}

void build(int u,int l,int r)
{
	tr[u] = {l,r};
	
	if(l == r)
	{
		tr[u].sum = d[l];
		tr[u].g = abs(d[l]);
		tr[u].mx = abs(d[l]);
		
		return;
	}
	
	int mid = l + r >> 1;
	build(u<<1,l,mid);
	build(u<<1|1,mid+1,r);
	
	pushup(tr[u],tr[u<<1],tr[u<<1|1]);
}

void update(int u,int x,int v)
{
	if(tr[u].l == x && tr[u].r == x)
	{
		tr[u].sum = d[x];
		tr[u].g = abs(d[x]);
		tr[u].mx = abs(d[x]);
		return;
	}
	
	int mid = tr[u].l + tr[u].r >> 1;
	if(x <= mid) update(u<<1,x,v);
	else update(u<<1|1,x,v);
	
	pushup(tr[u],tr[u<<1],tr[u<<1|1]);
}

node query(int u,int l,int r)
{
    // if(l > r) return;
	if(tr[u].l >= l && tr[u].r <= r) return tr[u];
	
	int mid = tr[u].l + tr[u].r >> 1;
	
	if(r <= mid) return query(u<<1,l,r);
	else if(l > mid) return query(u<<1|1,l,r);
	else
	{
		node no1 = query(u<<1,l,r);
		node no2 = query(u<<1|1,l,r);
		node ans;
		
		pushup(ans,no1,no2);
		
		return ans;
	}
}

int main()
{
	iire(n,m);
	for(int i=1;i<=n;i++) ire(a[i]);
	for(int i=1;i<=n;i++) d[i] = a[i] - a[i-1];
	
	build(1,1,n);
	
	while(m--)
	{
		int op;
		ire(op);
		int l,r,x;
		iire(l,r);
		
		if(op == 1)	//修改
		{
			ire(x);
			
			d[l] += x;
			update(1,l,x);
			
			if(r < n)	//不是最后一个点
			{
				d[r+1] -= x;
				update(1,r+1,-x);
			}
		}
		else if(op == 2)
	    {
	        if(l == r) cout<<0<<endl;
	        else cout<<query(1,l+1,r).mx<<'\n';
	    }
		else
		{
		    if(l == r) cout<<query(1,1,l).sum<<'\n';
		    else
		    {
		        node no1 = query(1,1,l);
    			node no2 = query(1,l+1,r);
    			
    			cout<<__gcd(no1.sum,no2.g)<<'\n';
		    }
		}
	}
	
	
	return 0;
}