牛客小白16H小阳的贝壳 (线段树+差分）

牛客小白16H小阳的贝壳 (线段树+差分）

代码

#include <iostream>
#include <cstdio>
#include<cstring>
#include<algorithm>

#define dbg(a)  cout<<#a<<" : "<<a<<endl;
#define IOS std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
#define PAUSE   system("pause")
#define sd(a)       scanf("%d",&a)
#define sll(a)      scanf("%intd",&a)
#define sdd(a,b)    scanf("%d%d",&a,&b)
#define sddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sf(a)       scanf("%lf",&a)
#define sff(a,b)    scanf("%lf%lf",&a,&b)
#define rep(i, a, b) for(int i = a; i <= b; i ++)

using namespace std;

typedef long long LL;

const int N = 100010;
int w[N];

struct Node {
    int l, r;
    LL sum, d;
    LL mx;
}tr[N * 4];

LL gcd(LL a, LL b) {
    return b?gcd(b, a % b):a;
}

void pushup(Node &u, Node &l, Node &r) {
    u.sum = l.sum + r.sum;
    u.d = gcd(l.d, r.d);
    u.mx = max(l.mx, r.mx);
}

void pushup(int u) {
    pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}

void build(int u, int l, int r){
    if(l == r) {
        LL b = w[r] - w[l - 1];
        tr[u] = {l, r, b, b, abs(b)};
    }
    else {
        tr[u].l = l, tr[u].r = r;
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}

void modify(int u, int x, LL v) {
    if(tr[u].l == x && tr[u].r == x) {
        LL b = tr[u].sum + v;
        tr[u] = {x, x, b, b, abs(b)};
    }
    else {
        int mid = tr[u].l + tr[u].r >> 1;
        if(x <= mid) modify(u << 1, x, v);
        else modify(u << 1 | 1, x, v);
        pushup(u);
    }
}

Node query_gcd(int u, int l, int r) {
    if(tr[u].l >= l && tr[u].r <= r) return tr[u];
    else {
        int mid = tr[u].l + tr[u].r >> 1;
        if(r <= mid) return query_gcd(u << 1, l, r);
        else if(l > mid) return query_gcd(u << 1 | 1, l, r);
        else {
            auto left = query_gcd(u << 1, l, r);
            auto right = query_gcd(u << 1 | 1, l, r);
            Node res;
            pushup(res, left, right);
            return res;
        }
    }
}

LL query_max(int u, int l, int r) {
    if(tr[u].l >= l && tr[u].r <= r) return tr[u].mx;
    int mid = tr[u].l + tr[u].r >> 1;
    LL maxx = -0x3f3f3f3f;
    if(l <= mid) maxx = max(maxx, query_max(u << 1, l, r));
    if(r > mid) maxx = max(maxx, query_max(u << 1 | 1, l, r));
    return maxx;
}

int main() {
    int n, m;
    sdd(n, m);
    rep(i, 1, n)
        sd(w[i]);
    build(1, 1, n);
    while(m --) {
        int op, l, r, c;
        sddd(op, l, r);
        if(op == 1) {
            sd(c);
            modify(1, l, c);
            if(r + 1 <= n) modify(1, r + 1, -c);
        }
        else if(op == 2) {
            if(l == r) printf("%d\n", 0);
            else printf("%lld\n", query_max(1, l + 1, r));
        }
        else {
            auto left = query_gcd(1, 1, l);
            Node right({0, 0, 0, 0});
            if(l + 1 <= r) right = query_gcd(1, l + 1, r);
            printf("%lld\n", abs(gcd(left.sum, right.d)));
        }
    }
    
    return 0;
}