Darn it, I meant to post "Sticker shock", but my typo left out the 't'. .
Thanks for the clarification, Sticker. I believe your algo can be tweaked a bit by simply adjusting your substring's info when you need to "go back" to the start of a substring. That is, when you drop the 2 from the substring, and the new substring begins with 3 in your example, just subtract 2 from the substring, shorten the L of the substring by 1, and then add your next number to the substring (making it 3,4,5,6,7), with a stop at 8. (from your number 2 to number 3 example). >From your description, it sounds like you're rebuilding each substring you extend, from scratch, every time you drop a number off the back end. This problem seems very sequentially oriented. I don't see any way to "divide and conquer" it profitably, either. I like to actually force myself to solve a bit of it by hand, and then see what "tricks" can be learned from that exercise. Humans are just so wonderfully lazy and efficient, sometimes. Wish I could be more helpful. Anybody have any good tips on this for Sticker? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
