http://en.wikipedia.org/wiki/Longest_increasing_subsequence
On Fri, Dec 31, 2010 at 12:29 PM, juver++ <[email protected]> wrote: > There is no need in segment tree. It can be solved using any balanced bst. > In C++ it can be std::set. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Cheers Naveen Kumar -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
