[UVA][最短路] 12295 - Optimal Symmetric Paths
Optimal Symmetric Paths
You have a grid of n rows and n columns. Each of the unit squares contains a non-zero digit. You
walk from the top-left square to the bottom-right square. Each step, you can move left, right, up or
down to the adjacent square (yo...
