萌新刚学线段树，咋就T了x

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 8000000 + 10;
int n, m;
int num[maxn];
struct Tr
{
    int l, r;
    int v;
}tr[maxn];

void Read()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> num[i];
    }
}

void Build(int L, int R, int i)
{
    tr[i].l = L;    tr[i].r = R;//区间范围

    if (L == R) 
    {
        tr[i].v = num[L];
    }
    else
    {
        int M = (L + R) / 2;
        Build(L, M, 2 * i);
        Build(M + 1, R, 2 * i + 1);
        tr[i].v = min(tr[2 * i].v, tr[2 * i + 1].v);
    }
}

int Fun(int qL, int qR, int i)
{
    int L = tr[i].l, R = tr[i].r;
    if (qL <= L && R <= qR) return tr[i].v;
    int ans = 1e8, M = (L + R) / 2;
    if (qL <= M) ans = min(ans, Fun(qL, qR, 2 * i));
    if (M + 1 <= qR) ans = min(ans, Fun(qL, qR, 2 * i + 1));
    return ans;
}
   
void Print()
{
    for (int i = 1; i <= n; i++)
    {
        if (i == 1) cout << 0 << '\n';
        else    cout << Fun(max(1, i - m), i - 1, 1) << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    Read();
    Build(1, n, 1);
    Print();
    getchar(); getchar();
    return 0;
}