SRM 596, D2, 500-Pointer (ColorfulRoad)

James S. Plank

Sun Nov 3 11:08:44 EST 2013
I don't provide a solution to this one; however, I have lecture notes written up for it for CS302. Those notes are in: http://web.eecs.utk.edu/~plank/plank/classes/cs302/Topcoder/ColorfulRoad.html.

This would be a good practice problem for Dijkstra's Algorithm, Dynamic Programming, Topological Sort, or frankly, even Enumeration! My lecture notes use Dijkstra's Algorithm.