为什么这题用倍增会有两个点超时？？？求问大佬。。

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int maxn=2000001;

int dp[maxn][20];

int n,m; 

void ST(){
    int i,j;
    for(j=1;(1<<j)<=n;j++){
        for(i=1;i+(1<<j)-1<=n;i++){
            if(dp[i][j-1]<dp[i+(1<<(j-1))][j-1]){
                dp[i][j]=dp[i][j-1];
            }
            else{
                dp[i][j]=dp[i+(1<<(j-1))][j-1];
            }
        }
    }
}

int RMQ(int L,int R){
    int len=R-L+1;
    int k=0;
    while((1<<(k+1)<=len)){
        k++;
    }
    int ans;
    if(dp[L][k]<dp[R-(1<<k)+1][k]){
        ans=dp[L][k];
    }
    else{
        ans=dp[R-(1<<k)+1][k];
    }
    return ans;
}

int main(){
    int i;
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;i++){
        scanf("%d",&dp[i][0]);
    }
    printf("0\n");
    ST();
    for(i=2;i<=n;i++){
        int l,r;
        r=i-1;
        l=i-m;
        if(l<=0){
            l=1;
        }
        printf("%d\n",RMQ(l,r));
    }
    return 0;
}