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

Re^3: Puzzle: Longest Increasing Sequence

by kaif (Friar)
on Apr 16, 2006 at 17:10 UTC ( #543661=note: print w/replies, xml ) Need Help??


in reply to Re^2: Puzzle: Longest Increasing Sequence
in thread Puzzle: Longest Increasing Sequence

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.
  • Comment on Re^3: Puzzle: Longest Increasing Sequence

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (2)
As of 2017-06-27 02:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (598 votes). Check out past polls.