-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB14003.java
More file actions
61 lines (50 loc) · 1.4 KB
/
B14003.java
File metadata and controls
61 lines (50 loc) · 1.4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
package Practice;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class B14003 { //가장 긴 증가하는 부분 수열 5
static int N;
static int[] A, dp, indexOrder, p;
public static void main(String[] args) throws Exception {
// TODO Auto-generated method stub
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
N = Integer.parseInt(br.readLine());
A = new int[N];
dp = new int[N];
indexOrder = new int[N];
p = new int[N];
StringTokenizer st = new StringTokenizer(br.readLine());
for(int i = 0; i < N; i++) A[i] = Integer.parseInt(st.nextToken());
Arrays.fill(dp, Integer.MAX_VALUE);
int len = 0;
dp[0] = A[0];
indexOrder[0] = 0;
for(int i = 1; i < N; i++) {
int temp = b_s(A[i], 0, len);
indexOrder[i] = temp;
dp[temp] = A[i];
if(len < temp) len++;
}
int ans = len + 1;
for(int i = N - 1; i >= 0; i--) {
if(indexOrder[i] == len) {
p[len] = A[i];
len--;
}
}
sb.append(ans).append('\n');
for(int i = 0; i < ans; i++) sb.append(p[i]).append(' ');
System.out.println(sb);
}
static int b_s(int key, int start, int end) {
while(start <= end) {
int mid = (start + end) / 2;
if(dp[mid] < key) start = mid + 1;
else if(dp[mid] > key) end = mid - 1;
else return mid;
}
return start;
}
}