Sliding Window Maximum

Hard Deque PRO

🔒 Login to Unlock

Problem Statement

Write a C program to find the maximum for each sliding window of size k in an array using a deque.

Input Format

First line contains n and k. Second line contains n elements.

Output Format

Print maximum elements for each sliding window separated by spaces.

Constraints

1 <= k <= n <= 50

Sample Input

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

Sample Output

3 3 5 5 6 7

Explanation

Maintain a deque storing indices of array elements in decreasing order of their values within the sliding window.

Starter Code

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n, k;
    if (scanf("%d %d", &n, &k) == 2) {
        // Write your code here for sliding window maximum using deque
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock