代码RE，40分，4绿6紫。

#include <iostream>
#include <cmath>
#define int long long
using namespace std;
int f[1000005][35];
signed main()
{
    int n,m;
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 1;i <= n;i++) cin >> f[i][0];
    for (int j = 1;j <= 20;j++)
        for (int i = 1;i <= n;i++)
            if (i + (1 << j) - 1 <= n)
                f[i][j] = min(f[i][j-1],f[i+(1<<(j-1))][j-1]);
    int t = sqrt(n);
    for (int i = 1;i <= n-m+1;i++) cout << min(f[i][t],f[i+m-1-(1<<t)+1][t]) << '\n';
    return 0;
}