1. You are given a number n, representing the size of array a. 2. You are given n numbers, representing the elements of array a. 3. You are given a number k, representing the size of window. 4. You are required to find and print the maximum element in every window of size k. e.g. for the array [2 9 3 8 1 7 12 6 14 4 32 0 7 19 8 12 6] and k = 4, the answer is [9 9 8 12 12 14 14 32 32 32 32 19 19 19]
Input Format
Input is managed for you
Output Format
Maximum of each window in separate line
Constraints
0 <= n < 100000 -10^9 <= a[i] <= 10^9 0 < k < n
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
17 2 9 3 8 1 7 12 6 14 4 32 0 7 19 8 12 6 4
Output
9 9 8 12 12 14 14 32 32 32 32 19 19 19