Longest Increasing Subsequence using Segment Trees

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

  1. https://discuss.codechef.com/questions/7770/longest-increasing-subsequence-get-the-sequence
  2. 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

1 Like
//