Minimum Transport Cost HDU - 1385(flyoed + 记录路径 模板)

分析

1. 这题就是就是 floyed ， 而且给的图还有点权 cost [i]，难点是在记录路径，
2. 在记录路径的时候我们可以设一个数组，path [][], 初始化 path [i][j] = j, 在随着的 floyed 更新 dis [][] 数组的时候只需要也随着更新 path [i][j] 就行了，
   
3. 输出的时候的代码为
   

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <vector>
using namespace std;
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {     
#ifdef ACM  //宏定义免注释 freopen
    if (! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) sc("%lld", &a)
#define ss(a) sc("%s", a)
#define __  pr( "------------------------\n" );
#define ___ pr("\n------------------------\n");
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
/*=========================ACMer===========================*/
const ll mxn = 1e3 + 10;
ll path[mxn][mxn];
ll dis[mxn][mxn];
ll cost[mxn];


void init(ll n)
{
    for_(i, 1, n)
    {
        for_(j, 1, i)
        {
            dis[i][j] = dis[j][i] = (i == j ? 0 : INF);
        }
    }
}

int main()
{
    Run();
    ll n; 
    while (sd(n) && n)
    {
        init(n);
        for_(i, 1, n)
        {
            for_(j, 1, n)
            {
                sd(dis[i][j]);
                if (dis[i][j] == -1) dis[i][j] = INF;
                path[i][j] = j;
            }
        }

        for_(i, 1, n) sd(cost[i]);

        for_(k, 1, n)
        {
            for_(i, 1, n)
            {
                for_(j, 1, n)
                {
                    if (dis[i][j] > dis[i][k] + dis[k][j] + cost[k])
                    {
                        dis[i][j] = dis[i][k] + dis[k][j] + cost[k];
                        path[i][j] = path[i][k];
                    }
                    else if (dis[i][j] == dis[i][k] + dis[k][j] + cost[k] && path[i][j] > path[i][k])
                    {
                        path[i][j] = path[i][k];
                    }
                }
            }
        }

        ll u, v;
        while (sc("%lld %lld", &u, &v) && (~ u || ~ v))
        {
            ll x = u, y = v;
            pr("From %lld to %lld :\n", u, v);
            pr("Path: %lld", x);
            while (x != y)
            {
                ll z = path[x][y];
                pr("-->%lld", z);
                x = z;
            }
            pr("\n");
            pr("Total cost : %lld\n\n", dis[u][v]);
        }
    }

    return 0;
}