Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Puzzle: Longest Increasing Sequence

by gaal (Parson)
on Apr 16, 2006 at 08:25 UTC ( #543624=note: print w/replies, xml ) Need Help??

in reply to Puzzle: Longest Increasing Sequence

Isn't this O(n)? Scan the list and maintain the tuple (start index, length) for your best candidate so far, as well as for the subsequence you are looking at now. If you are currently looking at your best candidate, keep incremening both length field as long as the sequence is monotonic. Reset the 'current' tuple or install the 'best' tuple as appropriate.
  • Comment on Re: Puzzle: Longest Increasing Sequence

Replies are listed 'Best First'.
Re^2: Puzzle: Longest Increasing Sequence
by BrowserUk (Pope) on Apr 16, 2006 at 10:40 UTC

    This works if you are looking for the longest contiguous ascending sequence.

    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.
Re^2: Puzzle: Longest Increasing Sequence
by jdporter (Canon) on Apr 16, 2006 at 15:42 UTC

    The problem is, you could have as many as i (where i = 1 to n) "best candidates" at any time. Consider — if the list looks like this:

    9 7 5 3 1 x
    (i.e. you've processed all but the last number) you won't know until you look at the last number which of the preceding numbers (if any) are in the solution. x could be 10, or it could be 2, for example.

    So you need to keep all the increasing subsequences seen so far; and that could be as many as n; and that means the algorithm is at least O(n log n).

    We're building the house of the future together.
      Well, no, you only need to keep at most one increasing subsequence for each length. In your example, you can forget about the 9, 7, 5, and 3 entirely. Any increasing subsequence beginning with them will be just as long if they begin with the 1 instead.
      Yes, as BrowserUk++ points out, I was wrongly assuming contiguous subsequences in the problem statement.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://543624]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (2)
As of 2017-12-17 03:22 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (462 votes). Check out past polls.