Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^3: Puzzle: Longest Increasing Sequence

by gaal (Parson)
on Apr 17, 2006 at 05:13 UTC ( #543759=note: print w/replies, xml ) Need Help??


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

Yes, as BrowserUk++ points out, I was wrongly assuming contiguous subsequences in the problem statement.
  • 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://543759]
help
Chatterbox?
[marto]: clever stuff
[Corion]: marto: Thanks for pointing me to Tinc - I found at least some article that suggests that what I want would be possible with Tinc. Now I can try that out :)
[marto]: I think you can do what you want without too much hassle, but yeah, please try and let me know if it works well :)
[marto]: sadly I've still not remembered the name of that x86 all in one we discussed

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (9)
As of 2018-01-17 15:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How did you see in the new year?










    Results (201 votes). Check out past polls.

    Notices?