E - Obstacle Course的详细解答

Sunshine_HJian

于 2019-03-07 13:38:13 发布

阅读量295

点赞数 1

分类专栏： ACM 文章标签： E - Obstacle Course

本文链接：https://blog.csdn.net/weixin_43903478/article/details/88299069

版权

编程解决火星探测器路径规划问题，寻找从左上角到右下角的最小成本路径。输入包含矩阵大小N及N×N的费用，通过上、下、左、右移动。输出每组问题的最小路径成本。示例输入和输出给出详细说明。解题策略是用队列更新地图中节点的值。

摘要由CSDN通过智能技术生成

E - Obstacle Course的详细解答

You are working on the team assisting with programming for the Mars rover. To conserve energy, the rover needs to find optimal paths across the rugged terrain to get from its starting location to its final location. The following is the first approximation for the problem.

N * N square matrices contain the expenses for traversing each individual cell. For each of them, your task is to find the minimum-cost traversal from the top left cell [0][0] to the bottom right cell [ N-1][ N-1]. Legal moves are up, down, left, and right; that is, either the row index changes by one or the column index changes by one, but not both.
Input
Each problem is specified by a single integer between 2 and 125 giving the number of rows and columns in the N * N square matrix. The file is terminated by the case N = 0.

Following the specification of N you will find N lines, each containing N numbers. These numbers will be given as single digits