题目(材料题)
01 #include <iostream>
02 using namespace std;
03 int n, m, a[100007], L, R, lg[100007], i, j, t, dp[100007][25], pw[25];
04 int gcd(int x, int y) {
05 if (y == 0) return x;
06 return gcd(y, x % y);
07 }
08 int main() {
09 cin >> n >> m;
10 for (i = 1; i <= n; i++) cin >> a[i];
11 t = 0;
12 pw[0] = 1;
13 for (i = 1; i <= 24; i++) pw[i] = pw[i - 1] * 2;
14 for (i = 2; i <= 100000; i++)
15 if (pw[t + 1] >= i) lg[i] = t;
16 else t++, lg[i] = t;
17 for (i = 1; i <= n; i++)
18 dp[i][0] = a[i];
19 for (j = 1; j <= lg[n]; j++)
20 for (i = 1; i + pw[j] - 1 <= n; i++) {
21 dp[i][j] = gcd(dp[i][j - 1], dp[i + pw[j - 1]][j - 1]);
22 }
23 for (i = 1; i <= m; i++) {
24 cin >> L >> R;
25 cout << gcd(dp[L][lg[R - L + 1]], dp[R - pw[lg[R - L + 1]] + 1][lg[R - L + 1]]) << endl;
26 }
27 return 0;
28 }
保证$1≤n≤100000$，每次查询满足$1≤L≤R≤n$，且数组$a$的元素均为正整数。
||
关注我们
