Skip to main content

All about Longest Increasing Sub-sequence (LIS)

Dynamic Programming - (N*N)
calculating LCS value print solution LCS (NlogN)

Comments

Popular posts from this blog

Histogram - LOJ

It's a well-known problem and the well-known solution is using a stack. I tried to solve it by segment tree( iterative version for building tree ) and got TLE. Hope I can optimize the code.  TLE CODE