On Monday, 22 July 2013 17:09:18 UTC+5:30, Guilherme Puglia wrote: > Hi Anup, > > Could you give more details about your DP? > > What are the subproblems? > > Regards, > Guilherme Puglia > > > > > Guilherme Puglia > > > > On Mon, Jul 22, 2013 at 8:32 AM, anup1pma <[email protected]> wrote: > > hi all, > > I tried to solve this problem using dynamic programming. can any one > explain the approach to solve this problem using both top down and bottom up > dp.. > > > > Thanks in advance > > > > Regards > > Anup Singh > > > > -- > > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > > To post to this group, send email to [email protected]. > > To view this discussion on the web visit > https://groups.google.com/d/msgid/google-code/12c01272-3a59-4546-ab2b-c70d77b76bf7%40googlegroups.com. > > > For more options, visit https://groups.google.com/groups/opt_out.
for each car we can load it to left lane or right lane on the ferry. so there can be some overlapping sub problems. here ferry length can be 10000 cm. so array[10001][10001][n] is not possible, here n is number of cars. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/5a48405e-ee03-4da9-aef5-3dbc3f9947e1%40googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
