RMQ问题--ST

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 const int maxn = 1e5+;
 int f[maxn][];
 int n,m;
 inline int RMQ(int l,int r){
     int k = log2(r-l+);
     return min(f[l][k],f[r-(<<k)+][k]);
 }
 inline void ST(){
     for(int j = ;j <= ;j++)
         for(int i = ;i <= n;i++)
             if(i+(<<j)- <= n)
                 f[i][j] = min(f[i][j-],f[i+(<<(j-))][j-]);
 }
 int main(){
     cin>>n>>m;
     for(int i = ;i <= n;i++)
         scanf("%d",&f[i][]);
     ST();
     for(int i = ,x,y;i <= m;i++){
         scanf("%d%d",&x,&y);
         printf("%d ",RMQ(x,y));
     }
     return ;
 }

 #include<iostream>
 #include<cstdio>
 using namespace std;
 const int maxn = 1e5+;
 int a[maxn],f[maxn][],log[maxn];
 int n,m;
 inline int RMQ(int l,int r){
     int k = log[r-l+];
     return min(f[l][k],f[r-(<<k)+][k]);
 }
 inline void ST(){
     log[] = -;
     for(int i = ;i <= n;i++){
         f[i][] = a[i];
         log[i] = log[i>>]+;
     }
     for(int j = ;j <= log[n];j++)
         for(int i = ;(i+(<<j)- <= n) && (i <= n);i++)
             f[i][j] = min(f[i][j-],f[i+(<<j-)][j-]);
 }
 int main(){
     cin>>n>>m;
     for(int i = ;i <= n;i++)
         scanf("%d",&a[i]);
     ST();
     for(int i = ,x,y;i <= m;i++){
         scanf("%d%d",&x,&y);
         printf("%d ",RMQ(x,y));
     }
     return ;
 }