一.题目链接:
Interval GCD
二.题目大意:
有一个长度为 n 的数组 A.
现有两种操作:
① 使数组 A 中区间 [l, r] 的元素都加 d.
② 求出数组 A 中区间 [l, r] 的元素的最大公约数.
三.分析:
操作 ② 很明显是用线段树来实现,重点在操作 ①.
操作 ① 可以用懒惰标记写,不过这里介绍另一种方法.
由更相减损之术得,gcd(x, y) == gcd(x, y - x).
现拓展到三个参数的时候,即求 gcd(x, y, z).
gcd(x, y, z)
= gcd(x, gcd(y, z))
= gcd(x, gcd(y, z - y))
= gcd(x, y, z - y)
= gcd(gcd(x, y), z - y)
= gcd(gcd(x, y - x), z - y)
= gcd(x, y - x, z - y)
即 gcd(x, y, z) == gcd(x, y - x, z - y).
由数学归纳法可推广到任意参数.
即
设 a 的差分序列为 b,即 b[i] = a[i] - a[i - 1] (i >= 2).
得
采用差分序列,即可轻易地进行区间修改,即将 b[l] += d, b[r + 1] -= d.
求 a[l],即求 b[1] + b[2] + ... + b[l].
用线段树维护差分数组 b 即可.
详见代码.
四.代码实现:
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <bitset>
#include <vector>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define eps 1e-6
#define lc k * 2
#define rc k * 2 + 1
#define pi acos(-1.0)
#define ll long long
#define ull unsigned long long
using namespace std;
const int M = (int)5e5;
const int mod = (int)1e9 + 7;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll a[M + 5], b[M + 5];
struct node
{
ll gcd;
ll sum;
}tree[M * 4 + 5];
ll gcd(ll x, ll y)
{
return y ? gcd(y, x % y) : x;
}
void push_up(int k)
{
tree[k].sum = tree[lc].sum + tree[rc].sum;
tree[k].gcd = gcd(tree[lc].gcd, tree[rc].gcd);
}
void build(int k, int l, int r)
{
if(l == r)
{
tree[k].sum = tree[k].gcd = b[l];
return;
}
int mid = (l + r) >> 1;
build(lc, l, mid);
build(rc, mid + 1, r);
push_up(k);
}
ll query_sum(int k, int l, int r, int a, int b)
{
if(l >= a && r <= b)
return tree[k].sum;
ll sum = 0;
int mid = (l + r) >> 1;
if(a <= mid)
sum += query_sum(lc, l, mid, a, b);
if(mid < b)
sum += query_sum(rc, mid + 1, r, a, b);
return sum;
}
ll query_gcd(int k, int l, int r, int a, int b)
{
if(l >= a && r <= b)
return tree[k].gcd;
int mid = (l + r) >> 1;
if(mid >= b)
return query_gcd(lc, l, mid, a, b);
else if(mid < a)
return query_gcd(rc, mid + 1, r, a, b);
else
{
ll s1, s2;
s1 = query_gcd(lc, l, mid, a, b);
s2 = query_gcd(rc, mid + 1, r, a, b);
return gcd(s1, s2);
}
}
void add(int k, int l, int r, int a, ll b)
{
if(l == r)
{
tree[k].gcd = tree[k].sum += b;
return;
}
int mid = (l + r) >> 1;
if(a <= mid)
add(lc, l, mid, a, b);
else
add(rc, mid + 1, r, a, b);
push_up(k);
}
int main()
{
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i)
{
scanf("%lld", &a[i]);
b[i] = a[i] - a[i - 1];
}
build(1, 1, n);
char dir;
int a, b;
ll c, ans;
while((m--) > 0)
{
cin >> dir;
if(dir == 'Q')
{
scanf("%d %d", &a, &b);
ans = query_sum(1, 1, n, 1, a);
if(a < b)
ans = gcd(ans, query_gcd(1, 1, n, a + 1, b));
printf("%lld\n", (ll)abs(ans));
}
else if(dir == 'C')
{
scanf("%d %d %lld", &a, &b, &c);
add(1, 1, n, a, c);
if(b + 1 <= n)
add(1, 1, n, b + 1, -c);
}
}
return 0;
}