-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path14003.java
More file actions
70 lines (62 loc) · 2.08 KB
/
Copy path14003.java
File metadata and controls
70 lines (62 loc) · 2.08 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
62
63
64
65
66
67
68
69
70
// https://www.acmicpc.net/problem/14003
// 가장 긴 증가하는 부분 수열 5
import java.util.*;
import java.lang.*;
import java.io.*;
class Main {
private static int n, arr[], indexs[];
private static List<Integer> list = new ArrayList<>();
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
n = Integer.parseInt(reader.readLine());
arr = new int[n];
indexs = new int[n];
Arrays.fill(indexs, -1);
StringTokenizer st = new StringTokenizer(reader.readLine());
for(int i=0; i<n; i++){
arr[i] = Integer.parseInt(st.nextToken());
indexs[i] = addToList(arr[i]);
//debug("iter"+(i+1)+": input="+arr[i]);
}
// output
int size = list.size();
System.out.println(size);
List<Integer> answer = new LinkedList<>();
for(int i=n-1; i>=0; i--){
if(indexs[i] == size-1){
answer.add(0, arr[i]);
size--;
}
}
StringBuilder sb = new StringBuilder();
for(int a : answer) sb.append(a).append(' ');
System.out.println(sb);
}
// lower bound, return inserted index
private static int addToList(int value){
if(list.isEmpty() || list.get(list.size()-1) < value){
list.add(value);
return list.size()-1;
}
int start = 0, end = list.size() - 1, mid;
while(start < end){
mid = (end + start) / 2;
if(list.get(mid) < value)
start = mid + 1;
else if(list.get(mid) == value)
return -1;
else
end = mid - 1;
}
if(list.get(start) < value) start++;
list.set(start, value);
return start;
}
private static void debug(String header){
System.out.println(header);
System.out.println(list);
for(int i : indexs)
System.out.print(i+" ");
System.out.println("\n");
}
}