3 ms·
This is a dynamic programming problem; if anyone wants a resource, I'd recommend this book [1]. Longest Increasing Subsequence is on page 162. [1] http://algor
by QML 9y ago
This is a dynamic programming problem; if anyone wants a resource, I'd recommend this book [1]. Longest Increasing Subsequence is on page 162.
[1] http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-...