Length of Longest Increasing Subsequence

LIS.py

def LIS(a):
    """Longest Increasing Subsequences"""
    L = [1] * len(a)
    for i in range(len(a)):
        for j in range(i):
            if a[j] < a[i] and L[i] < 1+L[j]:
                L[i] = 1 + L[j]
    return max(L)
a = [5,7,4,-3,9,1,10,4,5,8,9,3]
LIS(a)