- 풀이
stack에 index를 넣어가며 전에 더 작은값이 있으면 교체
- 코드
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
public class Main {
static int N;
static int[] array, temp;
static StringBuilder sb;
public static void main(String[] args) throws Exception {
SetData();
System.out.println(sb);
}
// 데이터
private static void SetData() throws Exception {
InputReader in = new InputReader(System.in);
N = in.nextInt();
array = new int[N];
temp = new int[N];
sb = new StringBuilder();
for(int i = 0 ; i< N; i++)
array[i] = in.nextInt();
Arrays.fill(temp, -1);
Stack<Integer> stack = new Stack<>();
stack.push(0);
for (int i = 1; i < N; i++) {
while (!stack.isEmpty() && array[stack.peek()] < array[i]) {
temp[stack.pop()] = array[i];
}
stack.push(i);
}
for (int i = 0; i < N; i++)
sb.append(temp[i] + " ");
}
}
class InputReader {
private final InputStream stream;
private final byte[] buf = new byte[8192];
private int curChar, snumChars;
public InputReader(InputStream st) {
this.stream = st;
}
public int read() {
if (snumChars == -1)
throw new InputMismatchException();
if (curChar >= snumChars) {
curChar = 0;
try {
snumChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (snumChars <= 0)
return -1;
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public int[] nextIntArray(int n) {
int a[] = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
public String nextLine() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isEndOfLine(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
private boolean isEndOfLine(int c) {
return c == '\n' || c == '\r' || c == -1;
}
}
'algorithm' 카테고리의 다른 글
[BOJ/JAVA] 백준 1956번 : 운동 (0) | 2021.08.16 |
---|---|
[BOJ/JAVA] 백준 1717번 : 집합의 표현 (0) | 2021.08.12 |
[BOJ/JAVA] 백준 1043번 : 거짓말 (0) | 2021.08.11 |
[BOJ/JAVA] 백준 2003번 : 수들의 합 2 (0) | 2021.08.10 |
[BOJ/JAVA] 백준 1074번 : Z (0) | 2021.08.10 |