- 思路
求区间GCD,已三个数GCD为例,
设三个数为a,b,c. _gcd(a, b, c) = _gcd(_gcd(a, b) ,c).
整体思路, 全部数的gcd等于左半边的gcd和右半边gcd. 所以,思路使用线段树求gcd就好.
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1005;
int a[N], tree[N<<2];
int n, m;
int lc(int p ) {
return p << 1;
}
int rc(int p ) {
return p << 1 | 1;
}
void pushup(int p, int l, int r) {
tree[p] = __gcd(tree[lc(p)], tree[rc(p)]);
}
void buildTree(int p, int l, int r) {
if(l == r) {
tree[p] = a[l];
return ;
}
int mid = l + r >> 1;
buildTree(lc(p), l, mid);
buildTree(rc(p), mid+1, r);
pushup(p, l, r);
}
int query(int p, int l, int r, int ql , int qr) {
if(l >= ql && r <= qr) {
return tree[p];
}
int mid = l + r >> 1;
int res &#