POJ - 2253（Frogger）最短路——Floyd算法

题目链接：http://poj.org/problem?id=2253

题目意思：这道题是先要你输入各个石头的坐标，第一个坐标表示Freddy所在的石头的坐标，第二个坐标表示Fiona所在石头的坐标。Freddy想通过石头跳着去找她。从第一块石头到第二块石头有很多种路径，每条路径中相距最大的两块石头之间的距离为“青蛙距离”，求所有路径中最小的青蛙距离。

这题本来想用dijkstra算法的，但后来发觉不仅麻烦，而且很难理解，所以就试了一下Floyd，发现比dijkstra好很多。
核心代码：

for (int k = 0; k < n; k++)//允许经过0~k的坐标
   for (int i = 0; i < n; i++)//从i号坐标开始
    for (int j = 0; j < n; j++)//目标坐标
     dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j]));//求从i到j所有路径中最小的青蛙距离

#include <iostream>
#include<algorithm>
#include <cmath>
#include<iomanip>
using namespace std;
const int inf = 0x3f3f3f3f;
double dis[1001][1001];
struct node
{
	int x, y;
}map[1001];

double get(int a, int b)
{
	double n;
	n = (map[a].x - map[b].x)*(map[a].x - map[b].x) + (map[a].y - map[b].y)*(map[a].y - map[b].y);
	return sqrt(n);
}

int main()
{
	int ca = 1,n;
	while (cin >> n && n)
	{
		for (int i = 0; i < n; i++)
			cin >> map[i].x >> map[i].y;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				if (i == j)
					dis[i][j] = 0;
				else
					dis[i][j] = dis[j][i] = get(i, j);
		for (int k = 0; k < n; k++)
			for (int i = 0; i < n; i++)
				for (int j = 0; j < n; j++)
					dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j]));
		cout << "Scenario #" << ca++ << endl;
		cout << "Frog Distance = "<< fixed << setprecision(3) << dis[0][1] << endl<<endl;

	}

}

好吧，过了一天，又尝试了dijkstra，终于ac了。

#include<algorithm>
#include <cmath>
#include<iomanip>
using namespace std;
const int inf = 0x3f3f3f3f;
double dis[1001][1001],dis1[1001];
int vis[1001],n;
struct node
{
	int x, y;
}map[1001];

double get(int a, int b)
{
	double n;
	n = (map[a].x - map[b].x)*(map[a].x - map[b].x) + (map[a].y - map[b].y)*(map[a].y - map[b].y);
	return sqrt(n);
}

vioid dijkstra()
{
	for (int i = 1; i <= n; i++)
	{
		dis1[i] = inf;
		vis[i] = 0;
		dis1[i] = dis[1][i];
	}
	dis1[1] = 0;
	for (int i = 1; i <= n; i++ )
	{
		int x = 0;
		double minn = inf;
		for(int j=1;j<=n;j++)
			if (!vis[j] && dis1[j] <= minn)
			{
				minn = dis1[j];
				x = j;
			}
		vis[x] = 1;
		for (int j = 1; j <= n; j++)
		{
			dis1[j] = min(dis1[j], max(dis1[x], dis[x][j]));
		}

	}
}
int main()
{
	int ca = 1;
	while (cin >> n && n)
	{
		for (int i = 1; i <= n; i++)
			cin >> map[i].x >> map[i].y;
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (i == j)
					dis[i][j] = 0;
				else
				{
					dis[i][j] = dis[j][i] = get(i, j);
					//cout << dis[i][j] << endl;
				}
		dijkstra();
		cout << "Scenario #" << ca++ << endl;
		cout << "Frog Distance = " << fixed << setprecision(3) << dis1[2] << endl << endl;

	}

}