洛谷(深入理解Floyd算法)P1119 灾后重建

for(k=1;k<=n;k++)

    for(i=1;i<=n;i++)

        for(j=1;j<=n;j++)

            if(e[i][j]>e[i][k]+e[k][j])

                 e[i][j]=e[i][k]+e[k][j];

//核心代码，仅仅只有5行

这段代码的基本思想就是：最开始只允许经过1号顶点进行中转，接下来只允许经过1和2号顶点进行中转……允许经过1~n号所有顶点进行中转，求任意两点之间的最短路程。用一句话概括就是：从i号顶点到j号顶点只经过前k号点的最短路程。

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<queue>
#include<list>


#include<bitset>
#include<map>
#include<limits>  
#include<string>
#include<set>
using namespace std;
//typedef  ll int;
#define ll long long 
#define MAX 10010
#define INF 0x3f3f3f3f
int time1[MAX];
ll g[300][300];
int main()
{//3 5 6 
	ios::sync_with_stdio(false);
	cin.tie(0);
#ifndef ONLINE_JUDGE
	freopen("sb.txt", "r", stdin);
#endif
	int n, m;
	cin >> n >> m;
	//fill(g, g + 55 * 55, INF);
	for (int i = 0; i < 300; i++)
		for (int j = 0; j < 300; j++)
			g[i][j] = 0x3f3f3f3f3f3f3f3f;
	for (int i = 0; i < n; i++)
	{
		cin >> time1[i];
	}


	for (int i = 0; i < m; i++)
	{
		ll from, to, cap;
		cin >> from >> to >> cap;
		g[from][to] = g[to][from] = cap;
	}
	int q;
	cin >> q;
	int now = 0;
	for (int i = 0; i < q; i++)
	{
		ll from, to, t;
		cin >> from >> to >> t;
		while (time1[now] <= t && now < n)
		{
			for (int j = 0; j < n; j++)
				for (int k = 0; k < n; k++)
				{
					g[j][k] = min(g[j][k], g[j][now] + g[now][k]);
				}
			now++;
		}
		if (time1[from] > t || time1[to] > t)cout << -1<<endl;
		else
		{
			if (g[from][to] == INF)cout << -1 << endl;
			else
			{
				cout << g[from][to] << endl;
			}
		}
	}



	return 0;
}