Shortest Path（NOIOPJENGLISH07）

Shortest Path

Shortest Path | JXNUOJ

 1000ms  65536K

描述：

There is a graph with N nodes. Given the length of each edge between the nodes. Find the shortest path from S to E.

有一个含有n个节点的图表，给出每两个节点间边的长度，找出从s到e的最短路径

输入：

First line: three positive integer number N (N <= 100), S (S <= N), E(E <= N).
Next N lines: the i-th line contains N non-negative integers (<= 100), indicating the length of edge from the i-th node to any nodes.

第一行：三个正整数表示n、s、e

下面n行：第i行包含n个非负整数，表示第i个节点到其他节点的距离

输出：

One line contains several integers, indicating the indexes of node in the shortest path from S to E.

一行包含几个整数，表示在s到e最短路径上节点的索引

样例输入：

4 1 4
0 3 6 8
3 0 2 9
6 2 0 2
8 9 2 0

样例输出：

1 2 3 4