Longest Increasing Subsequence

def get_lis(d):
    p = [0 for x in xrange (len (d))]
    m = [0 for x in xrange (len (d) + 1)]
    l = 0
    for i in xrange (len(d)):
        lo = 1
        hi = l
        while lo <= hi:
            mid = (lo + hi) / 2
            if d[m [mid]] < d[i]:
                lo = mid + 1
            else:
                hi = mid - 1
        new_l = lo
        p [i] = m[new_l - 1]
        m [new_l] = i
        if new_l > l:
            l = new_l
    S = [0 for x in xrange (l)]
    k = m[l ]
    for i in xrange (l - 1, -1 , -1):
        S [i] = d[k ]
        k = p[k ]
    return S

print get_lis([1, 3, 4, 5, 6, 2])