chartfix.py

def chartFix(chart):
    def longest_increasing_subsequence(d):
        l = []
        for i in range(len(d)):
            l.append(max([l[j] for j in range(i) if l[j][-1] < d[i]] or [[]], key=len)
                    + [d[i]])
        return max(l, key=len)

    return len(chart) - len(longest_increasing_subsequence(chart))