8 3
1 3 -1 -3 5 3 6 7

3 3 5 5 6 7

1 1
1

1

from collections import deque
import sys

class Solution:
    def maxSlidingWindow(self, nums, k):
        deque_window = deque()  # 双端队列
        result = []
        
        for i in range(len(nums)):
            # 移除窗口左侧已过期的元素索引
            if deque_window and deque_window[0] < i - k + 1:
                deque_window.popleft()
            
            # 保持队列单调递减，移除所有小于当前元素的索引
            while deque_window and nums[deque_window[-1]] < nums[i]:
                deque_window.pop()
            
            # 添加当前元素索引
            deque_window.append(i)
            
            # 记录最大值（窗口形成后）
            if i >= k - 1:
                result.append(nums[deque_window[0]])

        return result

if __name__ == "__main__":
    # 读取输入
    n, k = map(int, sys.stdin.readline().split())
    nums = list(map(int, sys.stdin.readline().split()))
    
    # 计算滑动窗口最大值
    solution = Solution()
    result = solution.maxSlidingWindow(nums, k)
    
    # 输出结果
    print(" ".join(map(str, result)))

import java.util.*;
import java.io.*;

public class Main {
    public class Solution {
        public int[] maxSlidingWindow(int[] nums, int k) {
            Deque<Integer> deque = new LinkedList<>();
            int n = nums.length;
            int[] result = new int[n - k + 1];
            int index = 0;

            for (int i = 0; i < n; i++) {
                // 移除窗口外的元素
                if (!deque.isEmpty() && deque.peekFirst() < i - k + 1) {
                    deque.pollFirst();
                }

                // 维护单调递减队列
                while (!deque.isEmpty() && nums[deque.peekLast()] < nums[i]) {
                    deque.pollLast();
                }

                // 加入当前元素索引
                deque.offerLast(i);

                // 记录窗口最大值
                if (i >= k - 1) {
                    result[index++] = nums[deque.peekFirst()];
                }
            }

            return result;
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] nk = reader.readLine().split(" ");
        int n = Integer.parseInt(nk[0]);
        int k = Integer.parseInt(nk[1]);

        String[] numStr = reader.readLine().split(" ");
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = Integer.parseInt(numStr[i]);
        }

        Main main = new Main();
        Solution solution = main.new Solution();
        int[] result = solution.maxSlidingWindow(nums, k);

        // 输出结果
        for (int i = 0; i < result.length; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(result[i]);
        }
        System.out.println();
    }
}

#include <iostream>
#include <vector>
#include <deque>

using namespace std;

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        vector<int> result;
        deque<int> dq;  // 双端队列，存储索引
        
        for (int i = 0; i < nums.size(); i++) {
            // 移除窗口外的元素
            if (!dq.empty() && dq.front() < i - k + 1) {
                dq.pop_front();
            }
            
            // 维护单调递减队列
            while (!dq.empty() && nums[dq.back()] < nums[i]) {
                dq.pop_back();
            }
            
            // 加入当前元素索引
            dq.push_back(i);
            
            // 记录最大值
            if (i >= k - 1) {
                result.push_back(nums[dq.front()]);
            }
        }
        
        return result;
    }
};

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> nums(n);
    
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }
    
    Solution solution;
    vector<int> result = solution.maxSlidingWindow(nums, k);
    
    for (int i = 0; i < result.size(); i++) {
        if (i > 0) cout << " ";
        cout << result[i];
    }
    cout << endl;

    return 0;
}