题目:
链接:点击打开链接
题意:
思路:
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define INF 100000000
const int N = 110;
int n,m;
int map[N][N],dis[N][N];
int result;
void floyd()
{
for(int k=1; k<=n; k++)
{
for(int i=1; i<=k; i++)
{
for(int j=i+1; j<=k; j++)
result = min(result,map[i][k] + map[k][j] + dis[i][j]);
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(dis[i][j] > dis[i][k] + dis[k][j])
dis[i][j] = dis[i][k] + dis[k][j];
}
}
}
}
int main()
{
//freopen("input.txt","r",stdin);
int a,b,c;
while(scanf("%d%d",&n,&m) != EOF)
{
for(int i=0; i<=n; i++)
{
for(int j=0; j<=n; j++)
{
map[i][j] = dis[i][j] = INF;
}
}
for(int i=1; i<=m; i++)
{
scanf("%d%d%d",&a,&b,&c);
if(map[a][b] > c)
map[a][b] = map[b][a] = dis[a][b] = dis[b][a] = c;
}
result = INF;
floyd();
if(result == INF)
printf("It's impossible.\n");
else
printf("%d\n",result);
}
return 0;
}
-------------------------------------------------------------------------------------
收获:
->最小环问题的解法:(无向图,有向图要考虑两点就能构成环的情况)
用Floyd的改进写法可以解决最小环问题,时间复杂度是O(n^3),代码如下:
for(int k=1; k<=n; k++)
{
for(int i=1; i<=k; i++)//新增部分
{
for(int j=i+1; j<=k; j++)
result = min(result,map[i][k] + map[k][j] + dis[i][j]);
}//******************************
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(dis[i][j] > dis[i][k] + dis[k][j])
dis[i][j] = dis[i][k] + dis[k][j];
}
}
}
-------------------------------------------------------------------------------------
战斗,从不退缩;奋斗,永不停歇~~~~~~~~~~~~~~~~~~~~~~~