Solution to the longest increasing subsequence problem, in 5 lines of python

longest-increasing-subsequence.py

def lis(a):
	L = []
	for (k,v) in enumerate(a):
		L.append(max([L[i] for (i,n) in enumerate(a[:k]) if n<v] or [[]], key=len) + [v])
	return max(L, key=len)

inp = [int(a) for a in input("List of integers: ").split(' ')]
print(lis(inp));

wow!!! nice work

Very useful!!
Thanks!