Floyd算法（求最短路）

题目：

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 210;
const int MAXN = 0x3f3f3f3f;
int n,m,q;
int d[N][N];//邻接矩阵建图 

void floyd()
{
	for(int k = 1;k <= n;k++)
	{
		for(int j = 1;j <= n;j++)
		{
			for(int i = 1;i <= n;i++){
				d[i][j] = min(d[i][j],d[i][k] + d[k][j]);//枚举只经过一个中间点，看哪个值最小 
			}
		}
	}
}
int main()
{
	cin>>n>>m>>q;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= n;j++)
		{
			if(i == j)d[i][j] = 0;
			else d[i][j] = MAXN;//初始化 
		}
	}
	
	while(m--)
	{
		int a,b,w;
		cin>>a>>b>>w;
		d[a][b] = min(d[a][b],w);//排除自环和重边 
	}
	floyd();
	while(q--)
	{
		int a,b;
		cin>>a>>b;
		if(d[a][b] > MAXN/2)cout<<"impossible"<<endl;
		else cout<<d[a][b];
	}
	
	return 0;
}

//3 3 2
//1 2 1
//2 3 2
//1 3 1
//2 1
//1 3