Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
76 changes: 76 additions & 0 deletions 0224LJH/202507/28 BOJ 가장 긴 증가하는 부분 수열 4.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,76 @@
```java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {

static int size, maxLen;
static int[] arr;
static int[] dp, ans;


public static void main(String[] args) throws IOException {
init();
process();
print();
}

private static void init() throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
size = Integer.parseInt(br.readLine());
arr = new int[size];
dp = new int[size];
ans = new int[size];
maxLen = 1;
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < size; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
}

private static void process() {
for (int i = 0; i < size; i++) {
dp[i] = 1;
for (int j = 0; j < i; j++) {
if (arr[j] < arr[i]) {
dp[i] = Math.max(dp[i], dp[j] + 1);
}
}
maxLen = Math.max(maxLen, dp[i]);
}

int lastIndex = -1;
for (int i = size - 1; i >= 0; i--) {
if (dp[i] == maxLen) {
lastIndex = i;
break;
}
}

// 2. 역추적하면서 수열 구성
int ansIndex = maxLen - 1;
int currentLen = maxLen;

for (int i = lastIndex; i >= 0; i--) {
if (dp[i] == currentLen) {
ans[ansIndex--] = arr[i];
currentLen--;
}
}
}

private static void print() {
System.out.println(maxLen);
for (int i = 0; i < maxLen; i++) {
System.out.print(ans[i]);
if (i < maxLen - 1) System.out.print(" ");
}
System.out.println();
}
}


```