## 2416: [C++一本通-动态规划]例9.5 最短路径

[上一题][提交][讨论版][状态][下一题]

## 题目描述

## 样例输入

10
0 2 5 1 0 0 0 0 0 0
0 0 0 0 12 14 0 0 0 0
0 0 0 0 6 10 4 0 0 0
0 0 0 0 13 12 11 0 0 0
0 0 0 0 0 0 0 3 9 0
0 0 0 0 0 0 0 6 5 0
0 0 0 0 0 0 0 0 10 0
0 0 0 0 0 0 0 0 0 5
0 0 0 0 0 0 0 0 0 2
0 0 0 0 0 0 0 0 0 0

## 样例输出

minlong=19
1 3 5 8 10

## 标签

[上一题][提交][讨论版][状态][下一题]