hiho 1068 重新整理的 Sparse-Table(RMQ)模板

http://hihocoder.com/problemset/problem/1067
代码:

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <cmath>
 #include <algorithm>
 #include <string>
 #include <queue>
 #include <stack>
 #include <vector>
 #include <map>
 #include <set>
 #include <functional>
 #include <cctype>
 #include <time.h>

 using namespace std;

 struct Sparse_Table {
     static const int MAXN = (int)1e6+;
     static const int MAXM = ;

     int ST[MAXM][MAXN];
     int bit[MAXN];
     int n;

     void init() { //初始化bit数组，放在程序开始的时候，只需做一次
         bit[] = bit[] = bit[] = ;
         for (int i = ; (i<<)<MAXN; i++)
             bit[i<<] = bit[i<<|] = bit[i]+;
     }

     void initTable(int a[], int n) {
         this->n = n;
         for (int i = ; i < n; i++)
             ST[][i] = a[i];
         int hight = bit[n];
         for (int i = ; i < hight; i++)
             for (int j = ; j+(<<i) < n; j++)
                     ST[i+][j] = min(ST[i][j], ST[i][j+(<<i)]);
     }

     inline int Query(int l, int r) {
         if (l==r) return ST[][l];
         int h = bit[r-l+];
         return min(ST[h][l], ST[h][r-(<<h)+]);
     }

     void output() {
         int h = bit[n];
         for (int i = ; i <= h; i++) {
             for (int j = ; j < n; j++)
                 printf("%d ", ST[i][j]);
             puts("");
         }
     }
 };

 const int INF = <<;
 const int MAXN = 1e6+;

 Sparse_Table solver;
 int a[MAXN];
 int n, Q;

 int main() {
     #ifdef Phantom01
         freopen("1068.txt", "r", stdin);
     #endif //Phantom01

     solver.init();

     while (scanf("%d", &n)!=EOF) {
         for (int i = ; i < n; i++) scanf("%d", &a[i]);

         solver.initTable(a, n);
         scanf("%d", &Q);
         for (int i = ; i < Q; i++) {
             int l, r;
             scanf("%d%d", &l, &r);
             printf("%d\n", solver.Query(l-, r-));
         }
     }

     return ;
 }