11003 최솟값 백준

#include <stdio.h>
#include <utility>
#include <deque>
 
using namespace std;
 
deque<pair<int, int> > dq;
int arr[10000000] = { 0 };
 
int main() {
    int n, l;
    scanf("%d %d", &n, &l);
    getchar();
 
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
 
    for (int i = 0; i < n; i++) {
        while (dq.empty() == false && dq.back().first > arr[i]) {
            dq.pop_back();
        }    
        dq.push_back(make_pair(arr[i],i));
 
        while (dq.front().second <= i - l) {
            dq.pop_front();
        }
        printf("%d ", dq.front().first);
    }
}