ST崩了，TLE*1+MLE*1

求助

#include<bits/stdc++.h>
using namespace std;
int dp[2000010][21];
int n,m;
inline void init();
inline int ask(int,int);
inline int getint();
inline double lg(double);
int main(int argc,char **argv){
    n=getint(),m=getint();
    for(register int i(1);i<=n;++i)dp[i][0]=getint();
    init();
    puts("0");
    for(register int i(2);i<=n;++i){
        printf("%d\n",ask(i-m<=0?1:i-m,i-1));
    }
    return 0;
}
inline int getint(){
    register int ret(0);
    register char ch(getchar());
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')ret=ret*10+ch-'0',ch=getchar();
    return ret;
}
inline void init(){
    for(register int j(1);j<21;++j){
        for(register int i(1);i<=n;++i){
            if(i+(1<<j)-1<=n){
                dp[i][j]=min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
            }
        }
    }
}
inline double lg(double num){
    return log(num)/log(2.0);
}
inline int ask(int l,int r){
    register int x((int)(lg((double)(r-l+1))));
    return min(dp[l][x],dp[r+1-(1<<x)][x]);
}