TFW you think something might be a hard problem and then it turns out to be O(n*log n) using DP. #LongestIncreasingSubsequenceProblem
-
Show this thread
The key insight: It is sufficient to remember just one (the last) increasing subsequence of each length.
3:30 AM - 3 Oct 2017
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.