Skip to content

Commit acd1ec1

Browse files
authored
Merge pull request #18 from solid-connection/JAEHEE25
[Week02] BOJ: 상자넣기
2 parents d320084 + 2cadaf9 commit acd1ec1

File tree

1 file changed

+34
-0
lines changed

1 file changed

+34
-0
lines changed
Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
package week02.BOJ_1965_상자넣기;
2+
3+
import java.util.*;
4+
import java.lang.*;
5+
import java.io.*;
6+
7+
class BOJ1965 {
8+
public static void main(String[] args) throws IOException {
9+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
10+
int N = Integer.parseInt(br.readLine());
11+
StringTokenizer st = new StringTokenizer(br.readLine());
12+
int[] arr = new int[N];
13+
for (int i = 0; i < N; i++) {
14+
arr[i] = Integer.parseInt(st.nextToken());
15+
}
16+
17+
int[] dp = new int[N]; //dp[인덱스] = 최대 수열의 길이
18+
Arrays.fill(dp, 1);
19+
20+
for (int i = 0; i < N; i++) {
21+
for (int j = 0; j < i; j++) {
22+
if (arr[j] < arr[i]) {
23+
dp[i] = Math.max(dp[i], dp[j] + 1);
24+
}
25+
}
26+
}
27+
28+
int answer = 0;
29+
for (int i : dp) {
30+
answer = Math.max(answer, i);
31+
}
32+
System.out.println(answer);
33+
}
34+
}

0 commit comments

Comments
 (0)