import java.io.*; import java.util.*; 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()); Num[] A = new Num[N]; Num[] sort_A = new Num[N]; StringTokenizer st = new StringTokenizer(br.readLine()); for (int i = 0; i < N; i++) { A[i] = new Num(Integer.parseInt(st.nextToken()), i); sort_A[i] = A[i]; } int M = Integer.parseInt(br.readLine()); Num[] B = new Num[M]; Num[] sort_B = new Num[M]; st = new StringTokenizer(br.readLine()); for (int i = 0; i < M; i++) { B[i] = new Num(Integer.parseInt(st.nextToken()), i); sort_B[i] = B[i]; } //정렬 배열 Arrays.sort(sort_A); Arrays.sort(sort_B); Deque dq = new ArrayDeque<>(); int a_idx =-1, b_idx = -1; loop:for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (sort_A[i].value == sort_B[j].value) { dq.push(sort_B[j]); a_idx = sort_A[i].idx; b_idx = sort_B[j].idx; break loop; } } } loop1:for (int i = a_idx + 1; i < N; i++) { loop2:for (int j = b_idx + 1; j < M; j++) { if (A[i].value == B[j].value) { while (!dq.isEmpty() && dq.getLast().value < B[j].value) { dq.removeLast(); } if (dq.getLast().idx >= B[j].idx) { continue; } dq.addLast(B[j]); break loop2; } } } System.out.println(dq.size()); while (!dq.isEmpty()) { System.out.print(dq.removeFirst().value + " "); } } static class Num implements Comparable { int value; int idx; Num(int value, int idx) { this.value = value; this.idx = idx; } @Override public int compareTo(Num o) { if (this.value < o.value) { return 1; } else if (this.value == o.value) { return this.idx - o.idx; } else { return -1; } } } }

제출 #10764

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: