st表但是全RE求救

#include<cstdio>
#include<queue>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
long long f[2000020][35];
int a[2000020];
int st(int n){
    int x=log(n)/log(2);
    for(int i=0;i<=n;i++)f[i][0]=a[i];
    for(int j=1;j<=x;j++)
        for(int i=1;i+(1<<j)-1<=n;i++){
               f[i][j]=min(f[i][j-1],f[i+(1<<(j-1))][j-1]);
    }
}
int rmqmin(int l,int r){
    int d=log(r-l+1)/log(2);
    return min(f[l][d],f[r-(1<<d)+1][d]);
}
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    st(n);
    for(int i=1;i<=n;i++){
        int l=i-m;int r=i-1;
        if(l<0)l=0;
        if(l==0)l=1;
        printf("%d\n",rmqmin(l,r));
    }
    return 0;
}