Can u teach me how to find Longest Increasing Subsequence using Segment Trees(nlogn) ?
I have already read these posts but they r highly unclear n confusing
- https://www.quora.com/What-is-the-approach-to-find-the-length-of-the-strictly-increasing-longest- subsequence
Can u plz give a detailed explanation using few examples n diagrams step by step. Thnx
BTW i m doing this ques