HDU5726 GCD（ST&RMQ）

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 #define rep(i,a,b)        for(int i(a); i <= (b); ++i)
 6 #define LL            long long
 7 
 8 const int N    =    100000        +    10;
 9 const int A    =    30        +    1;
10 
11 map <int, LL> mp;
12 int a[N];
13 int T;
14 int n, m;
15 int l, r;
16 int f[N][A];
17 int gcd(int a, int b){return b? gcd(b, a % b) : a;}
18 
19 inline int Solve(int l, int r){
20     int k = (int)log2((double)(r - l + 1));
21     return gcd(f[l][k], f[r - (1 << k) + 1][k]);    
22 }
23 
24 void Work(){
25     rep(i, 1, n) f[i][0] = a[i];
26     rep(j, 1, 17) rep(i, 1, n) if ((i + (1 << j) - 1) <= n) f[i][j] =gcd(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
27 }
28 
29 void setTable(){
30     mp.clear();
31     rep(i, 1, n){
32         int g = f[i][0], j = i;
33         while (j <= n){
34             int l = j, r = n;
35             while (l < r){
36                 int mid = (l + r + 1) >> 1;
37                 if (Solve(l, mid) == g) l = mid; else r = mid - 1;
38             }
39             mp[g] += l - j + 1;
40             j = l + 1;
41             g = Solve(i, j);
42         }
43     }
44 }
45 int main(){
46 
47     scanf("%d", &T);
48     rep(Case, 1, T){
49         printf("Case #%d:\n", Case);
50         scanf("%d", &n);
51         rep(i, 1, n) scanf("%d", a + i);
52         Work();
53         setTable();
54         scanf("%d", &m);
55         while (m--){
56             scanf("%d%d", &l, &r);
57             int g = Solve(l, r);
58             printf("%d %lld\n", g, mp[g]);
59         }
60     }
61 
62     return 0;
63     
64 }