[BOJ] 17299. 오등큰수

BaekJoon 17299. 오등큰수

* 문제의 저작권은 BOJ 및 문제를 만든 사람에게 있습니다.

 

 

 

 

 

[문제 접근]

아까 17298 오큰수 문제에다가 count 배열만 추가해서 비교해서 풀어줬다.

 

 

 

 

 

 

 

 

[코드]

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main_17299 {
	public static void main(String[] args) throws Exception, IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		
		
		int N = Integer.parseInt(br.readLine());
		int[] a = new int[N];
		int[] ans = new int[N];
		int[] cnt = new int[N];
		
		StringTokenizer st = new StringTokenizer(br.readLine());
		for (int i = 0; i < N; i++) {
			a[i] = Integer.parseInt(st.nextToken());
			cnt[a[i]] = cnt[a[i]] + 1;
		}
		
		Stack<Integer> stack = new Stack<>();
		stack.push(0);
		
		for (int i = 0; i < N; i++) {
			if (stack.isEmpty()) {
				stack.push(i);
			}
			
			while (!stack.isEmpty() && cnt[a[stack.peek()]] < cnt[a[i]]) {
				ans[stack.pop()] = a[i];
			}
			stack.push(i);
		}
		
		while (!stack.isEmpty()) {
			ans[stack.pop()] = -1;
		}
		
		for (int i = 0; i < ans.length; i++) {
			bw.write(ans[i] + " ");
		}
		bw.flush();
		
	}
}