是否有NlogN解决方案来找到最长的增长子序列?

I was solving this problem on HackerRank(Link : https://www.hackerrank.com/challenges/longest-increasing-subsequent/problem) but timed out on using an O(n*n) DP Approach.It would be great if someone can guide through the working of O(NLogN) solution for it.Not able to find a good explaination.