백준 17608_막대기_JAVA

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

17608번: 막대기

 

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

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(br.readLine()); // 막대기 갯수
        Stack<Integer> stack = new Stack<>();

        int max = 0;
        int answer = 0;

        for(int i = 0; i<N; i++) {
            stack.add(Integer.parseInt(br.readLine()));
        }

        while(!stack.isEmpty()) {
            int num = stack.pop();
            if (max < num) {
                max = num;
                answer++;
            }
        }

        System.out.print(answer);
    }
}

 

회고

- 간단한 스택 문제여서 금방 풀었다.