求从点1 到 2的所有路径中最长路径的最小值
我们利用floyd或者迪杰斯特拉思路都是一样的,之前在更新的时候 被更新路径 = min(被更新路径, 两条新路之和)
现在我们需要求最小化的最大值,只需要每次都从等效替代的几条路径中 取最小值即可,我们可以把这个过程放在松弛过程中进行
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
double a[205][205];
double x[205], y[205];
bool vis[205];
double calc(double a, double b, double c, double d)
{
return sqrt(abs(a-c)*abs(a-c)+abs(b-d)*abs(b-d));
}
int main()
{
int n;
int cas = 0;
while(scanf("%d", &n) != EOF && n)
{
memset(vis, 0, sizeof(vis));
for(int i = 1; i <= n; i ++){
scanf("%lf%lf", &x[i], &y[i]);
vis[i] = 1;
}
memset(a, inf, sizeof(a));
for(int i = 1; i <= n; i ++)
for(int j = i; j <= n; j ++)
{
if(j == i)
{
a[i][j] = 0;
continue;
}
if(vis[i] && vis[j])
{
a[i][j] = a[j][i] = calc(x[i], y[i], x[j], y[j]);
}
}
for(int k = 1; k <= n; k ++)
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
{
a[i][j] = min(a[i][j], max(a[i][k], a[k][j]));
}
printf("Scenario #%d\nFrog Distance = ", ++ cas);
printf("%.3f\n\n", a[1][2]);
}
return 0;
}
POJ - 1797
大同小异的一道题,都是考察如何松弛及如何初始化问题
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int n, m;
int a[1005][1005];
int d[1005];
bool vis[1005];
void dijs()
{
vis[1] = 1;
for(int i = 2; i <= n; i ++)
d[i] = a[1][i];
d[1] = 0;
int maxy, u;
for(int i = 1; i < n; i ++)
{
maxy = 0;
for(int j = 1; j <= n; j ++)
{
if(d[j] > maxy && ! vis[j])
{
maxy = d[j];
u = j;
}
}
vis[u] = 1;
for(int v = 1; v <= n; v ++)
{
if(! vis[v])
d[v] = max(min(d[u], a[u][v]), d[v]);
}
}
}
int main()
{
int t;
int cas = 0;
scanf("%d" ,&t);
while(t --)
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
if(i == j) a[i][j] = 0;
else a[i][j] = -1;
memset(vis, 0, sizeof(vis));
int u, v, w;
for(int i = 1; i <= m; i ++)
{
scanf("%d%d%d", &u,&v,&w);
if(a[u][v] < w)
a[u][v] = a[v][u] = w;
}
dijs();
printf("Scenario #%d:\n%d\n\n", ++ cas, d[n]);
}
return 0;
}