Search for Dynamic Programming (DP) and his close cousin memoization (not a typo). A very high percent of programming contests have at least one DP problem, so getting familiar with it will certainly help you improve in this type of competitions. You can check the tutorials at http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=alg_index And you can also look for the books "*Art of Programming Contest" and "Programming Challenges".*
There you will find information on DP and some other very common algorithms for programming contests. Carlos Guía On Sat, Sep 5, 2009 at 8:42 AM, Bjoern <[email protected]> wrote: > > Thanks! > > Just wondering, how did you arrive at the solution? In hindsight it > seems obvious, but I must admit I did not think of it during the > competition :-) Certainly I don't see a way to think of it in 10 > minutes or so. > > So I wonder if similar algorithms have come up in other programming > competitions, or if the approach in general is well known (what are > other use cases)? > > Just wondering how to improve my skills for the next round/future > competitions. > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" 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/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
