Longest Increasing Subsequence

Revision en1, by n8118, 2015-07-19 22:45:58

Can some one explain LIS, a O(nlog(n)) solution clearly as i couldn't find more resources to learn clearly on internet

Tags dynamic programming, arithmetic sequence, help, competitive programming

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English n8118 2015-07-19 22:45:58 148 Initial revision (published)