hdoj 1385 Minimum Transport Cost（dijkstar+字典路径||floyd+字典路径） - c++编程基础

printf("From %d to %d :\nPath: %d", start, end, start);
while(cur != end)
{
printf("-->%d",path[cur][end]);
cur = path[cur][end];
}
printf("\nTotal cost : %d\n\n", map[start][end]);
}
int main() www.2cto.com
{
int i = 0, j = 0;
while(scanf("%d",&n) , n)
{
for(i = 1; i<=n; i++)
{
for(j = 1; j<=n; j++)
{

scanf("%d",&map[i][j]);
if(map[i][j] == -1)
map[i][j] = inf;
}
}
for(i = 1; i<=n; i++)
scanf("%d",&tax[i]);
floyd();
while(scanf("%d %d",&start, &end), start != -1 && end != -1)
{
print();
}
}
return 0;
}

作者：ulquiorra0cifer

hdoj 1385 Minimum Transport Cost（dijkstar+字典路径||floyd+字典路径）(二)