CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 4 of 4

Threaded View

  1. April 10th, 2009, 02:22 AM #1
    zqzas
    zqzas is offline Junior Member
    Join Date
    Apr 2009
    Posts
    3

    Lightbulb A problem about Longest Increasing Subsequence

    Hello everyone!
    I have a difficult problem for me:

    Longest Increasing Subsequence may be familier to us.But there is an advanced question.That is how to find wheather there is a increasing subsequence of length L.If there is more than one ,just output the first one in dictionary order.
    We have to find a fast algo at least O(NlogN) where N is the length of the sequence.


    Thx!
    Last edited by zqzas; April 10th, 2009 at 03:17 AM.
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules




Click Here to Expand Forum to Full Width

Featured