是谁贴上了倍增的标签，果断TLE2点啊==

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define maxn 3000000
using namespace std;
int n,m,minn[maxn][24];
void init()
{
    for(int j=1;(1<<j)<=n;++j)
     for(int i=1;i+(1<<j)-1<=n;++i)
      minn[i][j]=min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]);
}
int rmq_min(int l,int r)
{
    int k=log2(r-l+1);
    return min(minn[l][k],minn[r-(1<<k)+1][k]);
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)
     cin>>minn[i][0];
    init();
    for(int i=1;i<=n;++i)
     {
         if(i==1) printf("0\n");
          else if(i<=m) printf("%d\n",rmq_min(1,i-1));
           else printf("%d\n",rmq_min(i-m,i-1));
     }
    return 0;
}
80不嫌弃拿走