I have tried to solve Digging Problem<https://code.google.com/codejam/contest/204113/dashboard#s=p1&a=1> and have gotten quite stuck. When I read the problem, I thought Dijkstra's Algorithm would beat it, and have tried to do so. But it seems my implementation has many flaws, and is not giving the required output.
Now, when I read the contest analysis - and I haven't understood the recurrence behind the DP solution; given the states (as in the analysis) So in short: 1) Is there a way to solve this using Dijkstra? 2) What's the recurrence behind the DP solution? Kindly help me. Thanks. -- 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/CAA0%2BsYu2_iGzKjbxsTcwRLefRNAfMzoE3LrX0f-7YsUZMtoU%2BA%40mail.gmail.com. For more options, visit https://groups.google.com/groups/opt_out.
