小阳的贝壳

https://ac.nowcoder.com/acm/contest/949/H

思路：线段树查询区间gcd，区间修改，差值最值 

#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------


const int maxn=2e5+9;
const int mod=1e9+7;

struct node
{
    int sum,gd;
    int val;
    int Max;
}tree[maxn*4];
int a[maxn];
void pushup(int rt)
{
    tree[rt].sum=tree[rt<<1].sum+tree[rt<<1|1].sum;
    tree[rt].gd=__gcd(tree[rt<<1].gd,tree[rt<<1|1].gd);
    tree[rt].Max=max(tree[rt<<1].Max,tree[rt<<1|1].Max);
}

void build(int rt,int l,int r)
{
    tree[rt].Max=0;
    tree[rt].sum=0;
    tree[rt].gd=0;
    tree[rt].val=0;
    if(l==r)
    {
        tree[rt].val=a[l];
        tree[rt].sum=a[l];
        tree[rt].gd=abs(a[l]);
        tree[rt].Max=abs(a[l]);
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}

void update(int rt,int l,int r,int pos,int val)
{
    if(l==r)
    {
        tree[rt].val+=val;
        tree[rt].sum+=val;
        tree[rt].gd=abs(tree[rt].sum);
        tree[rt].Max=abs(tree[rt].sum);
        return ;
    }
    int mid=(l+r)>>1;
    if(pos<=mid) update(rt<<1,l,mid,pos,val);
    else update(rt<<1|1,mid+1,r,pos,val);
    pushup(rt);
}

int query_gcd(int rt,int l,int r,int ql,int qr)
{
    if(ql>qr) return 0;
    if(ql<=l&&qr>=r) return tree[rt].gd;
    int mid=(l+r)>>1;
    if(qr<=mid) return query_gcd(rt<<1,l,mid,ql,qr);
    else if(ql>mid) return query_gcd(rt<<1|1,mid+1,r,ql,qr);
    else return __gcd(query_gcd(rt<<1,l,mid,ql,mid),query_gcd(rt<<1|1,mid+1,r,mid+1,qr));
}

int query_num(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r)
    {
        return tree[rt].sum;
    }
    int mid=(l+r)>>1;
    if(qr<=mid) return query_num(rt<<1,l,mid,ql,qr);
    else if(ql>mid) return query_num(rt<<1|1,mid+1,r,ql,qr);
    else return query_num(rt<<1,l,mid,ql,mid)+query_num(rt<<1|1,mid+1,r,mid+1,qr);
}

int query_Max(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r)
    {
        return tree[rt].Max;
    }
    int mid=(l+r)>>1;
    if(qr<=mid) return query_Max(rt<<1,l,mid,ql,qr);
    else if(ql>mid) return query_Max(rt<<1|1,mid+1,r,ql,qr);
    else return max(query_Max(rt<<1,l,mid,ql,mid),query_Max(rt<<1|1,mid+1,r,mid+1,qr));
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    //cin>>n>>m;
    n=read();
    m=read();
    for(int i=1;i<=n;i++)
    {
        //cin>>a[i];
        a[i]=read();
    }
    for(int i=n;i>1;i--) a[i]-=a[i-1];
    build(1,1,n);
    while(m--)
    {
        int op;
        int l,r;
        int x;
        //cin>>op;
        op=read();
        if(op==3)
        {
            //cin>>l>>r;
            l=read();
            r=read();
            printf("%d\n",abs(__gcd(query_gcd(1,1,n,l+1,r),query_num(1,1,n,1,l))));
            //cout<<abs(__gcd(query_gcd(1,1,n,l+1,r),query_num(1,1,n,1,l)))<<endl;
        }
        else if(op==1)
        {
            //cin>>l>>r>>x;
            l=read();
            r=read();
            x=read();
            update(1,1,n,l,x);
            if(r<n) update(1,1,n,r+1,-x);
        }
        else
        {
            l=read();
            r=read();
            if(l==r)
            {
                puts("0");
            }
            else
                printf("%d\n",abs(query_Max(1,1,n,l+1,r)));
        }
    }

    return 0;
}