Given a list of integers, write a function to find the longest increasing subsequence (LIS) within the list. The LIS is a subsequence of the given list in which the elements are sorted in strictly increasing order.
[10, 22, 9, 33, 21, 50, 41, 60, 80][10, 22, 33, 50, 60, 80]