Dynamic Programming ---》DP in B problem , you can find the lowest point and DFS to flood all the point that's can flow into the lowest point.
2009/9/4 Dhruva Sagar <[email protected]> > Excuse my newbieness, I know DFS (Depth First Search), but I am not able to > recollect, what's DP? > Thanks & Regards, > Dhruva Sagar. > > > Ted Turner <http://www.brainyquote.com/quotes/authors/t/ted_turner.html> - > "Sports is like a war without the killing." > > On Fri, Sep 4, 2009 at 8:05 AM, 蔡智聪 <[email protected]> wrote: > >> I use DFS to solve the B problem and use DP to solve the C problem. >> >> 2009/9/4 jiangwen jiang <[email protected]> >> >>> using dp in problem B and C >>> >>> 2009/9/3 oliviera <[email protected]> >>> >>> >>>> any one can explain me how to perform all this task ....it should be >>>> batter if any one is using C. >>>> >>>> >>>> >>> >>> >>> >> >> >> -- >> Please reply after you read this mail. >> Best Wishes! >> >> >> >> > > > > -- Please reply after you read this mail. Best Wishes! --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
