Given a list of integers, write a function to return the longest increasing subsequence present in the list. The subsequence does not need to be contiguous, but the elements must be in non-decreasing order.
[10, 22, 9, 33, 21, 50, 41, 60, 80][10, 22, 33, 50, 60, 80]