Longest Increasing Subsequence

Finds the longest strictly increasing subsequence via an O(n²) DP, tracking predecessors to rebuild the chain.