lis.py

def longest_increasing_subsequence(sequence):
    best_length = -1
    for bitmask in range(2**len(sequence)):
        subsequence = []
        for bit_idx in range(len(sequence)):
            if bitmask & (1 << bit_idx):
                subsequence.append(sequence[bit_idx])
        if not sorted(subsequence) == subsequence:
            continue
        if len(subsequence) > best_length:
            best_length = len(subsequence)
            best = subsequence
    return best

print(longest_increasing_subsequence([1, 5, 2, 3, 9, 10, 3, 3, 5]))