90分求助

第3个点WA

#include <iostream>
#include <queue>
using namespace std;
const int maxn = 1000050;

struct T
{
    int idx, v;
    T(int idx = -1, int v = -1) : idx(idx), v(v) {}
};

int A[maxn], n, k;
deque<T> q;

int main()
{
    cin >> n >> k;
    for (int i = 0; i < n; i++)
        cin >> A[i];
    for (int i = 0; i < n; i++)
    {
        if (i >= k)
        {
            if (q.front().idx + k < i)
                q.pop_front();
            cout << q.front().v << " ";
        }
        while (!q.empty() && q.back().v >= A[i])
            q.pop_back();
        q.push_back(T(i, A[i]));
    }
    cout << q.front().v << endl;
    q.clear();
    for (int i = 0; i < n; i++)
    {
        if (i >= k)
        {
            if (q.front().idx + k < i)
                q.pop_front();
            cout << q.front().v << " ";
        }
        while (!q.empty() && q.back().v <= A[i])
            q.pop_back();
        q.push_back(T(i, A[i]));
    }
    cout << q.front().v << endl;
#ifdef _MSC_VER
    cin >> ws;
#endif
    return 0;
}