线段树

245. 你能回答这些问题吗

刚刚做完这道题，心情有点复杂，先把题解链接发上来，我先去冷静一下

链接：https://www.acwing.com/solution/content/19422/

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 5e5 + 10;
typedef long long ll;

ll a[N];

struct Node {
    int l, r;
    ll sum, lmax, rmax, dat;
    
} tree[N * 4];

void push_up(int p)
{
	tree[p].sum = tree[p << 1].sum + tree[p << 1 | 1].sum;
    tree[p].dat = max(tree[p << 1].dat, tree[p << 1 | 1].dat);
    tree[p].dat = max(tree[p].dat, tree[p << 1 | 1].lmax + tree[p << 1].rmax);
    tree[p].lmax = max(tree[p << 1].lmax, tree[p << 1 | 1].lmax + tree[p << 1].sum);
    tree[p].rmax = max(tree[p << 1 | 1].rmax, tree[p << 1].rmax + tree[p << 1 | 1].sum);
}

void build(int p, int l, int r)
{
    tree[p].l = l, tree[p].r = r;
    tree[p].sum = 0;
    if (l == r) {
        tree[p].sum = tree[p].dat = tree[p].lmax = tree[p].rmax = a[l];
        return;
    }
    int mid = l + r >> 1;
    build(p << 1, l , mid);
    build(p << 1 | 1, mid + 1, r);
    
    push_up(p);
}

void update(int p, int l, int r, int val)
{
    if (tree[p].l == l && tree[p].r == r) {
    	tree[p].sum = tree[p].lmax = tree[p].rmax = tree[p].dat = val;
    	return;
    }
    
    //spread(p);
    int mid = tree[p].l + tree[p].r  >> 1;
    if (l <= mid) 
		update(p << 1, l, r, val);
    if (r > mid) 
		update(p << 1 | 1, l, r, val);
	
    push_up(p);
}

Node query(int p, int l, int r)
{
    if (l <= tree[p].l && tree[p].r <= r) 
		return tree[p];

    int mid = tree[p].l + tree[p].r >> 1;
    if (r <= mid) {
		return query(p << 1, l, r);
    } else if (l > mid) {
		return query(p << 1 | 1, l, r);
	} else {
		Node a = query(p << 1, l, mid), b = query(p << 1 | 1, mid + 1, r);
		Node c; c.l = l, c.r = r, c.sum = a.sum + b.sum;
		c.dat = max(max(a.dat, b.dat), a.rmax + b.lmax);
		c.lmax = max(a.lmax, a.sum + b.lmax);
		c.rmax = max(b.rmax, b.sum + a.rmax);
		
		return c;
	}
}

int main()
{
    int n, q, x, y, val, opt;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) {
		scanf("%lld", a + i);
	}
    build(1, 1, n);
    
    while (q--) {
        scanf("%d%d%d", &opt, &x, &y);
        if (opt == 1) {
        	if (x > y) swap(x, y);
            printf("%lld\n", query(1, x, y).dat);
        } else {
            update(1, x, x, y);
        }
    }
    return 0;
}

246. 区间最大公约数

a数组存原序列，b数组存差分序列，维护一个b数组的线段树

区间修改 l，r 只需要修改 l 点和 r+1 点

根据欧几里德算法，gcd(x, y, z) = gcd(x, y-x, z-y)

所以询问区间的最大公约数，就等于__gcd(a[l], query(1, l+1, r)) （这道题没有 l+1 > r 的数据）

可以再用线段树或者树状数组来维护b，a[l] = ask(l)

需要注意的细节：

1、开long long，一开始没有开long long，WA到怀疑人生

2、维护差分序列时，r+1可能会超过n，所以需要判断

3、差分序列可能为负，所以返回的gcd也可能为负，最后的答案需要加一个abs

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 5e5 + 10;
typedef long long ll;

ll a[N], b[N], c[N];
int n;

// 返回 x 的二进制数下最小2的次幂 
int lowbit(int x)
{
	return x & -x;
}
// 查询前缀和 
ll ask(int x)
{
	ll ans = 0;
	for (; x; x -= lowbit(x))
		ans += c[x];
	return ans;
}
// 单点增加 
void add(int x, ll y)
{
	for (; x <= n; x += lowbit(x))
		c[x] += y;
}

struct Node {
    int l, r;
    ll sum, maxv, lazy;
    void updade(ll x) {
        sum += (r - l + 1) * x;
        maxv += x;
        lazy += x;
    }
} tree[N * 4];

void push_up(int p)
{
	tree[p].sum = __gcd(tree[p << 1].sum, tree[p << 1 | 1].sum);
    tree[p].maxv = max(tree[p << 1].maxv, tree[p << 1 | 1].maxv);
}

void build(int p, int l, int r)
{
    tree[p].l = l, tree[p].r = r;
    tree[p].sum = tree[p].lazy = 0;
    if (l == r) {
        tree[p].sum = tree[p].maxv = b[l];
        return;
    }
    int mid = l + r >> 1;
    build(p << 1, l , mid);
    build(p << 1 | 1, mid + 1, r);
    push_up(p);
}

void spread(int p)
{
    int lazy_val = tree[p].lazy;
    if (lazy_val) {
        tree[p << 1].updade(lazy_val);
        tree[p << 1 | 1].updade(lazy_val);
        tree[p].lazy = 0;
    }
}

void update(int p, int l, int r, ll val)
{
    if (l <= tree[p].l &&  tree[p].r <= r) {
        tree[p].updade(val);
    } else {
        spread(p);
        int mid = tree[p].l + tree[p].r >> 1;
        if (l <= mid) 
			update(p << 1, l, r, val);
        if (r > mid) 
			update(p << 1 | 1, l, r, val);
        push_up(p);
    }
}

ll query(int p, int l, int r)
{
    if (l <= tree[p].l && tree[p].r <= r) 
		return tree[p].sum;

    spread(p);
    int mid = tree[p].l + tree[p].r >> 1;
    if (r <= mid) 
		return query(p << 1, l, r);
    else if (l > mid) 
		return query(p << 1 | 1, l, r);
	else
		return __gcd(query(p << 1, l, r), query(p << 1 | 1, l, r));
}

int main()
{
    int q, l, r;
    char opt[2];
    ll val;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) {
		scanf("%lld", a + i);
		b[i] = a[i] - a[i - 1];
		add(i, b[i]);
	}
    build(1, 1, n);
    
    while (q--) {
        scanf("%s", opt);
        if (opt[0] == 'Q') {
            scanf("%d %d", &l, &r);
            printf("%lld\n", abs(__gcd(ask(l), query(1, l + 1, r))));
        } else {
            scanf("%d %d %lld", &l, &r, &val);
            add(l, val);
            update(1, l, l, val);
            if (r + 1 <= n) {
            	add(r + 1, -val);
            	update(1, r + 1, r + 1, -val);
            }
        }
    }
    
    return 0;
}