HDU 5875 Function(logn取模+二分rmq)

$给你n个数字，q次询问，求a_l mod a_{l+1}mod ...moda_r$
$首先考虑到a_l取模到底，就loga_l次$
$然后就是你怎么找每次第一个比它小的数字$
$考虑线段树，但是需要二分区间，复杂度比较大（可能是我想烦了）$
$所以用rmq维护区间最小值，然后二分区间，复杂度O(nlog^2n)$
$如果是线段树的话，也是往两边分治下去，然后到[l,r]覆盖线段树的区间的时候$
$在这个区间里二分找，虽然跑得比二分rmq快，但是总感觉复杂度很大，额热切线段树常数大$
$在log比较多的题里面，还是尽量树状数组和rmq解决$

---

代码：

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           100005
#define   MAXN          1000005
#define   maxnode       15
#define   sigma_size    30
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-8;
const int    mod   = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

int a[MAX];
int d[MAX][25];
int n;
void RMQ_init(){
    for(int i=0;i<n;i++) d[i][0]=a[i];
    for(int j=1;(1<<j)<=n;j++){
        for(int i=0;i+(1<<j)-1<n;i++){
            d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
        }
    }
}

int query(int l,int r){
    if(l>r) return INF;
    int k=0;
    while((1<<(k+1))<=r-l+1) k++;
    return min(d[l][k],d[r-(1<<k)+1][k]);
}
int main(){
    //freopen("in.out","r",stdin);
    int t;
    cin>>t;
    while(t--){
        cin>>n;
        for(int i=0;i<n;i++) scanf("%d",&a[i]);
        RMQ_init();
        int m;
        cin>>m;
        for(int i=0;i<m;i++){
            int l,r;
            scanf("%d%d",&l,&r);
            l--;r--;
            int k=a[l];
            if(l==r){
                printf("%d\n",a[l]);
                continue;
            }
            l++;
            while(l<=r){
                //cout<<l<<" "<<r<<endl;
                int L=l,R=r;
                int flag=0;
                while(L<R){
                    int mid=(L+R)/2;
                    if(query(L,mid)<=k) R=mid;
                    else if(query(mid+1,R)<=k) L=mid+1;
                    else{
                        flag=1;
                        break;
                    }
                }
                if(flag) break;
                k%=a[L];
                l=L+1;
            }
            printf("%d\n",k);
        }
    }
    return 0;
}