DP/LongestIncreasingSubsequence.py

• View this file on GitHub
• Last update: 2022-05-22 23:05:29+09:00

Code

from bisect import bisect_left

def LIS(n: int, a: list) -> int:
    INF = 10 ** 18
    dp = [INF] * n
    for i in a:
        x = bisect_left(dp, i)
        dp[x] = i

    return bisect_left(dp, INF)

n = int(input())
a = list(map(int, input().split()))

cnt = LIS(n, a)
print(cnt)

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.12.3/x64/lib/python3.12/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.12.3/x64/lib/python3.12/site-packages/onlinejudge_verify/languages/python.py", line 96, in bundle
    raise NotImplementedError
NotImplementedError

Back to top page