RMQ

const int MAX = 1e6+100;
int dp[MAX][25];
void RMQ(){
    for(int i = 1; i <= n; i++) dp[i][0] = s[i];
    for(int i = 1; i < 25; i++)
        for(int j = 1; j + (1 << i) - 1 <= n; j++)
            dp[j][i] = min(dp[j][i-1],dp[(j+(1<<(i-1)))][i-1]);
}
int q_min(int x,int y){
    int k = (int)((log(y - x + 1) * 1.0) / log(2.0));
    return min(dp[x][k],dp[y - (1<<k) + 1][k]);
}