AcWing 246. 区间最大公约数

AcWing 246. 区间最大公约数
好恶心的一个板子，调了半天

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 5e5 + 10;

struct Node{
	int l, r;
	ll sum, d;  //区间和/区间公约数 
}tr[N * 4];

int n, m;
ll w[N];

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);
}

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[r - 1];
		tr[u] = {l, r, b, b};
	}
	else{
		tr[u] = {l, 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};
	}
	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(int u, int l, ll 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(u << 1, l, r);
		if(l > mid) return query(u << 1 | 1, l, r);
		else{
			Node left = query(u << 1, l, r);
			Node right = query(u << 1 | 1, l, r);
			Node tree;
			pushup(tree, left, right);
			return tree;
		}
	}
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i ++ ) scanf("%lld", &w[i]);
    build(1, 1, n);

    int l, r;
    ll d;
    char op[2];
    while (m -- )
    {
        scanf("%s%d%d", op, &l, &r);
        if (*op == 'Q')
        {
            auto left = query(1, 1, l);
            Node right({0, 0, 0, 0});
            if (l + 1 <= r) right = query(1, l + 1, r);
            printf("%lld\n", abs(gcd(left.sum, right.d)));
        }
        else
        {
            scanf("%lld", &d);
            modify(1, l, d);
            if (r + 1 <= n) modify(1, r + 1, -d);
        }
    }

    return 0;
}