Longest Increasing Subsequence

technogeek · Post by **technogeek** » Fri Jun 13, 2003 5:08 pm

In the problem History Grading I need to use this algorithm but don't know how. Can someone plese show me how to find LIS from an array of integers (named 'answer') in C code ?

bugzpodder · Post by **bugzpodder** » Fri Jun 13, 2003 11:29 pm

are you talking about the longest common subsequence?

technogeek · Post by **technogeek** » Sun Jun 15, 2003 3:02 pm

Nope. Not Longest Common Subsequence. Check out this link, it has some description :

Definition : http://mathworld.wolfram.com/LongestInc ... uence.html
Analysis : http://www2.toki.or.id/book/AlgDesignMa ... NODE47.HTM

I am still searching for good info on how to solve it.

OJ Board

Longest Increasing Subsequence

Longest Increasing Subsequence

NO...Not LCS