【BZOJ 5028 小Z的加油店】 裴蜀定理

BZOJ 5028
题目给你这一段瓶子能倒出来的最小水 其实不就是
ax + by + cz +… km的最小整数解么
用裴蜀定理可知这个解就是他们的区间gcd
那么答案就转换成区间gcd 和 区间更新
线段树如果要维护这些东西 肯定是要超时的
那么我们怎么做呢？
我们知道 gcd(x,y) = gcd(x,y-x)
gcd(x,y,z) = gcd(x,gcd(y,z))
那么x->y的区间gcd 就可以化成 arr[x] 和 差分线段树上 x+1和y的gcd
前面arr[x] 我们用一个树状数组去维护
后面的x+1和y的gcd的线段树 因为gcd满足区间传递性 所以直接维护即可
可能代码写的有点丑 实际上只要求abs 即可 但是abs 在 long long 容易出问题 所以写了个特判

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 200005;
ll arr[MAX_N],s[MAX_N<<2],C[MAX_N<<1];
void add(int x,int v)
{
    for(;x<MAX_N;x+=x&(-x))
        C[x]+=v;
}
int getsum(int x)
{
    int res= 0;
    for(;x;x-=x&(-x))
        res+=C[x];
    return res;
}
void up(int rt)
{
    s[rt] = gcd(s[rt<<1],s[rt<<1|1]);
}
void build(int rt,int l,int r)
{
    if(l==r)
    {
        if(l==1) s[rt] = arr[1];
        else s[rt] = arr[l] - arr[l-1];
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void update(int rt,int l,int r,int x,int v)
{
    if(l==r)
    {
        s[rt]+=v;
        return;
    }
    if(x<=mid) update(rt<<1,l,mid,x,v);
    else update(rt<<1|1,mid+1,r,x,v);
    up(rt);
}
ll query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        return s[rt];
    }
    if(x>mid) return query(rt<<1|1,mid+1,r,x,y);
    if(y<=mid) return query(rt<<1,l,mid,x,y);
    return gcd(query(rt<<1,l,mid,x,y),query(rt<<1|1,mid+1,r,x,y));
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,Q,opt,x,y,v;
    scanf("%d%d",&n,&Q);
    for(int i = 1;i<=n;++i) scanf("%lld",&arr[i]);
    build(1,1,n);
    while(Q--)
    {
        scanf("%d%d%d",&opt,&x,&y);
        if(opt==1)
        {
            if(x==y)
            {
                ll ans = arr[x]+getsum(x);
                if(ans<0) ans*=-1;
                printf("%lld\n",ans);
            }
            else
            {
                ll ans = gcd(arr[x]+getsum(x),query(1,1,n,x+1,y));
                if(ans<0) ans*=-1;
                printf("%lld\n",ans);
            }
        }
        else
        {
            scanf("%d",&v);
            add(x,v);
            add(y+1,-v);
            update(1,1,n,x,v);
            update(1,1,n,y+1,-v);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}