倍增维护RMQ，nlogn预处理，O(1)查询

#include
    
     using namespace std;const int maxn = 1e5+7;struct RMQ{    const static int RMQ_size = maxn;    int n;    int ArrayMax[RMQ_size][21];    int ArrayMin[RMQ_size][21];    int mm[RMQ_size];    void build_rmq(){        for(int j = 1 ; (1<
     
      <= n ; ++ j)            for(int i = 0 ; i + (1<