43 삐약 : 백준 2493| 탑 [바킹독 문제 풀이|스택|JAVA]

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

2493번: 탑

 

 

package BKD_0x5_Stack;

import java.io.*;
import java.util.Stack;
import java.util.StringTokenizer;


class Top{
    int num;
    int height;

    Top(int num, int height){
        this.height = height;
        this.num = num;
    }
}
public class BOJ_2493 {
    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 ;

        int N = Integer.parseInt(br.readLine());

        Stack<Top> stack = new Stack<>();
        StringBuilder answer = new StringBuilder();
        st = new StringTokenizer(br.readLine());

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


            while (true){
                if(stack.isEmpty()){
                    answer.append("0 ");
                    stack.push(new Top(i,height));
                    break;
                }
                Top top = stack.peek();

                if(top.height > height){
                    answer.append(top.num+" ");
                    stack.push(new Top(i,height));
                    break;
                }else stack.pop();
            }

        }


        bw.write(answer.toString() + "\n");
        bw.flush();
        bw.close();
        br.close();
    }
}

 

 

참고 : https://steady-coding.tistory.com/15

[BOJ] 백준 2493번 : 탑 (JAVA)