题意:一个青蛙跳石头,现在有N块石头,编号为1~n,输入这N个点的坐标。他要从1号石头跳到2号石头,让你求一条路径,使得该路径在所有路径中为最长边最短的那条路径,问这个最短边?
思路:最大值最小化问题。Floyd过程中不存储路径之和,存储路径中的最长边。
Floyd:
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int MAXN = 205;
const int INF = 0x3f3f3f3f;
int n;
double d[MAXN][MAXN];
struct Point
{
int x, y;
}point[MAXN];
double Distance(int a, int b)
{
return sqrt(pow(point[a].x - point[b].x, 2) + pow(point[a].y - point[b].y, 2));
}
void Floyd()
{
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
d[i][j] = min(d[i][j], max(d[i][k], d[k][j]));
}
}
}
}
int main()
{
int CASE = 1;
while (~scanf("%d", &n) && n)
{
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &point[i].x, &point[i].y);
for (int j = i; j >= 1; j--)
{
d[i][j] = d[j][i] = Distance(i, j);
}
}
Floyd();
if (CASE != 1) puts("");
printf("Scenario #%d\nFrog Distance = %.3f\n", CASE++, d[1][2]);
}
return 0;
}
/*
2
0 0
3 4
3
17 4
19 4
18 5
0
*/
Dijkstra过程中,每次求最短的边,以最短的边去松弛,松弛的时候取较大值(即石头之间的距离最大值)与dis数组比较,取较小的。初始化条件跟原来一样。懒得写,直接在我的模板上改的。
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int MAXN = 1e5 + 6;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to/*, dist*/; //起点,终点,距离
double dist;
//Edge(int u, int v, int w):from(u), to(v), dist(w) {}
Edge(int u, int v, double w):from(u), to(v), dist(w) {}
};
struct Dijkstra
{
int n, m; //结点数,边数(包括反向弧)
vector<Edge> edges; //边表。edges[e]和edges[e^1]互为反向弧
vector<int> G[MAXN]; //邻接表,G[i][j]表示结点i的第j条边在edges数组中的序号
int vis[MAXN]; //标记数组
//int d[MAXN]; //s到各个点的最短路
double d[MAXN]; //s到各个点的最短路
int pre[MAXN]; //上一条弧
void init(int n)
{
this->n = n;
edges.clear();
for (int i = 0; i <= n; i++) G[i].clear();
}
//void add_edge(int from, int to, int dist)
void add_edge(int from, int to, double dist)
{
edges.push_back(Edge(from, to, dist));
m = edges.size();
G[from].push_back(m - 1);
}
void dijkstra(int s)
{
for (int i = 0; i <= n; i++) d[i] = INF;
d[s] = 0;
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++)
{
int pos/*, MIN = INF*/;
double MIN = INF;
for (int j = 1; j <= n; j++)
{
if(!vis[j] && d[j] <= MIN) MIN = d[pos = j];
}
vis[pos] = true;
for (int j = 0; j < G[pos].size(); j++)
{
Edge& e = edges[G[pos][j]];
/*if (d[e.to] > d[pos] + e.dist)
{
d[e.to] = d[pos] + e.dist;
pre[e.to] = G[pos][j];
}*/
d[e.to] = min(d[e.to], max(d[pos], e.dist));
}
}
}
};
Dijkstra solve;
struct Point
{
int x, y;
}point[MAXN];
double Distance(int a, int b)
{
return sqrt(pow(point[a].x - point[b].x, 2) + pow(point[a].y - point[b].y, 2));
}
int main()
{
int CASE = 1, n;
while (~scanf("%d", &n) && n)
{
solve.init(n);
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &point[i].x, &point[i].y);
for (int j = i; j >= 1; j--)
{
double d = Distance(i, j);
solve.add_edge(i, j, d);
solve.add_edge(j, i, d);
}
}
solve.dijkstra(1);
if (CASE != 1) puts("");
printf("Scenario #%d\nFrog Distance = %.3f\n", CASE++, solve.d[2]);
}
return 0;
}
/*
2
0 0
3 4
3
17 4
19 4
18 5
0
*/