传送门:【POJ】1734 Sightseeing trip
题目分析:Floyd最小环,在floyd的同时注意记录前驱,然后每次更新最小环的时候用前驱更新就行了。为了输出路径方便(其实更本没啥变化,因为环正着输出和倒着输出一个样),这里的前驱就是后继,因为这样得到的解自然沿着环的方向逐一得到(就是因为是有向的,所以前驱做后继没啥必要T _ T。。。)。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
#define REP( i , a , b ) for ( int i = ( a ) ; i < ( b ) ; ++ i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define REV( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define travel( e , H , u ) for ( Edge* e = H[u] ; e ; e = e -> next )
#define CLR( a , x ) memset ( a , x , sizeof a )
const int MAXN = 105 ;
const int INF = 0x3f3f3f3f ;
int n , m ;
int G[MAXN][MAXN] , map[MAXN][MAXN] ;
int pre[MAXN][MAXN] ;
int ans , path[MAXN] , top ;
void solve () {
int u , v , c ;
FOR ( i , 1 , n ) FOR ( j , 1 , n ) G[i][j] = G[j][i] = map[i][j] = map[j][i] = ( i == j ? 0 : INF ) ;
CLR ( pre , 0 ) ;
ans = INF ;
while ( m -- ) {
scanf ( "%d%d%d" , &u , &v , &c ) ;
if ( G[u][v] > c ) {
G[u][v] = G[v][u] = c ;
map[u][v] = map[v][u] = c ;
pre[u][v] = v ;
pre[v][u] = u ;
}
}
FOR ( k , 1 , n ) {
REP ( i , 1 , k ) REP ( j , 1 , i )
if ( G[i][j] != INF && map[j][k] != INF && map[k][i] != INF )
if ( ans > G[i][j] + map[j][k] + map[k][i] ) {
ans = G[i][j] + map[j][k] + map[k][i] ;
top = 0 ;
int v = i ;
while ( v ) {
path[top ++] = v ;
v = pre[v][j] ;
}
path[top ++] = k ;
}
FOR ( i , 1 , n ) FOR ( j , 1 , n ) if ( G[i][j] > G[i][k] + G[k][j] ) {
G[i][j] = G[i][k] + G[k][j] ;
pre[i][j] = pre[i][k] ;
}
}
if ( ans == INF ) printf ( "No solution.\n" ) ;
else REP ( i , 0 , top ) printf ( "%d%c" , path[i] , i < top - 1 ? ' ' : '\n' ) ;
}
int main () {
while ( ~scanf ( "%d%d" , &n , &m ) ) solve () ;
return 0 ;
}