I use branch and bound method to solve problem B and dp to solve C. the complexity of B is H * W and C is 19 * string.lenth * string.lenth
Is there any better solution? On Fri, Sep 4, 2009 at 10:35 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! > > > > > -- 有D --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
