To make you recursive function fast enough for the large C, I recommend you read the dynamic programming tutorial at TopCoder. Here is the link to all the tutorials http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=alg_index Carlos Guía
On Thu, Sep 3, 2009 at 10:21 PM, Grant Kot <[email protected]> wrote: > yeah, this contest has told me that i really need to study up on > algorithms. it's also scary that the fast person completed all three in less > than half an hour. i got large and small for A and B correct but for C > somehow I had a recursive thing and it took forever and I couldn't figure > out how to make it faster so I ran out of time. for B my algorithm was > pretty crappy, i just looped through all the grid points, in order from left > to right and top down, found the basin that they flowed into, if it did not > already have a letter to go with it, i labeled that basin with the next > letter in the alphabet and also the grid point with the letter of the basin. > it still completed instantly, but i was not so lucky with C. > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
