-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathj.py
More file actions
58 lines (41 loc) · 1.33 KB
/
j.py
File metadata and controls
58 lines (41 loc) · 1.33 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
from __future__ import annotations
import itertools
import sys
from collections.abc import Sequence
def find_longest_increasing_subsequence(values: Sequence[int]) -> Sequence[int]:
subsequences = [-1]
predecessors = [-1] * len(values)
result_len = 0
for i, value in enumerate(values):
left = 1
right = result_len + 1
while left < right:
middle = (left + right) >> 1
if values[subsequences[middle]] < value:
left = middle + 1
else:
right = middle
new_result_len = left
if new_result_len > result_len:
result_len = new_result_len
subsequences.append(i)
else:
subsequences[new_result_len] = i
predecessors[i] = subsequences[new_result_len - 1]
result = [-1] * result_len
i = subsequences[result_len]
for j in range(result_len - 1, -1, -1):
result[j] = i
i = predecessors[i]
return result
def main() -> None:
values_count = int(input().strip())
values = list(itertools.islice(
map(int, sys.stdin.readline().split()),
values_count,
))
subsequence = find_longest_increasing_subsequence(values)
print(len(subsequence))
print(*map(lambda i: i + 1, subsequence))
if __name__ == '__main__':
main()