[백준 11003] 최솟값 찾기 (슬라이딩 윈도우)

문제

https://www.acmicpc.net/problem/11003

11003번: 최솟값 찾기

코드

package org.kyhslam.DoItAlgorithm.ch02;


import java.io.*;
import java.util.Deque;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class p11003 {



    public static void main(String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(br.readLine());
        int N = Integer.parseInt(st.nextToken());
        int L = Integer.parseInt(st.nextToken());

        st = new StringTokenizer(br.readLine());

        Deque<Node> mydeque = new LinkedList<>();

        for (int i = 0; i < N; i++) {
            int now = Integer.parseInt(st.nextToken());

            //새로 들어오는 값이 현재 수보다 큰 값이면 덱에서 제거
            while( !mydeque.isEmpty() && mydeque.getLast().value > now ){
                mydeque.removeLast();
            }

            mydeque.addLast(new Node(now, i));

            if (mydeque.getFirst().index <= i - L) {
                mydeque.removeFirst();
            }

            bw.write(mydeque.getFirst().value + " ");

            bw.flush();
            bw.close();
        }
    }

    private static class Node {
        int value;
        int index;

        public Node(int value, int index) {
            this.value = value;
            this.index = index;
        }
    }

}