在排列中查找已排序的子序列

def find_longest_subsequence(arr, sub_arr):
    m, n = len(arr), len(sub_arr)
    dp = [[0] * (n + 1) for _ in range(m + 1)]

    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if arr[i - 1] == sub_arr[j - 1]:
                dp[i][j] = dp[i - 1][j - 1] + 1
            else:
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])

    return dp[m][n]

arr = [1, 2, 3, 2, 4, 5, 6]
sub_arr = [2, 4, 6]

print(find_longest_subsequence(arr, sub_arr))  # 输出：3