<s>[INST] In a programming contest, the organiser tried to make the problem statement about a 'Longest Increasing Subsequence' as short as possible. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. For example, given the sequence [1, 7, 3, 5, 9, 4, 8], the longest increasing subsequence is [1, 3, 5, 9] or [1, 4, 8]. So you can use dynamic programming on each suffix of the sequence to produce an answer.[/INST]