http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=298
代码长了就容易出现错误
// File Name: dijkstra_jilulujin_zoj1298.cpp
// Author: bo_jwolf
// Created Time: Thursday, May 09, 2013 PM09:25:24 HKT
#include<stdio.h>
#define MAXN 500
#define INF 10000000
int n , m ;
int Edge[ MAXN ][ MAXN ] ;
int caseno = 1 ;
int time[ MAXN ] ;
int S[ MAXN ] ;
void solve_case()
{
int i , j , k ;
for( i = 0 ; i < n ; i++ )
{
time[ i ] = Edge[ 0 ][ i ] ;
S[ i ] = 0 ;
}
time[ 0 ] = 0 ;
S[ 0 ] = 1;
for( i = 0 ; i < n - 1 ; i++ )
{
int min = INF , u = 0 ;
for( j = 0 ; j < n ; j++ )
{
if( !S[ j ] && time[ j ] < min )
{
u = j ;
min = time[ j ] ;
}
}
S[ u ] = 1 ;
for( k = 0 ; k < n ; k++ )
{
if( !S[ k ] && Edge[ u ][ k ] < INF && time[ u ] + Edge[ u ][ k ] < time[ k ])
{
time[ k ] = time[ u ] + Edge[ u ][ k ] ;
}
}
}
double maxtime1 = -INF ;
int pos ;
for( i = 0 ; i < n ; i++ )
{
if( time[ i ] > maxtime1 )
{
maxtime1 = time[ i ] ;
pos = i ;
}
}
double maxtime2 = -INF , t ;
int pos1 , pos2 ;
for( i = 0 ; i < n ; i++ )
{
for( j = 0 ; j < n ; j++ )
{
t = ( time[ i ] + time[ j ] + Edge[ i ][ j ] ) / 2.0 ;
if( Edge[ i ][ j ] < INF && t > maxtime2 )
{
maxtime2 = t;
pos1 = i ;
pos2 = j ;
}
}
}
printf( "System #%d\n" , caseno++ ) ;
printf( "The last domino falls after " );
if( maxtime2 > maxtime1 )
printf( "%.1lf seconds, between key dominoes %d and %d.\n\n" ,maxtime2 , pos1 + 1 , pos2+ 1);
else
printf( "%.1lf seconds, at key domino %d.\n\n" , maxtime1 , pos + 1);
}
int read_case()
{
int i , j ;
int v1 ,v2 , t;
scanf( "%d%d" ,&n , &m ) ;
if( n==0 && m == 0 )
return 0 ;
for( i = 0 ; i < n ; i++ )
{
for( j = 0 ; j < n ; j++ )
Edge[ i ][ j ] = INF ;
}
for( i = 0 ; i < m ; i++ )
{
scanf( "%d%d%d" , &v1 , &v2 , &t ) ;
v1-- ;
v2-- ;
Edge[ v1 ][ v2 ] = Edge[ v2 ][ v1 ] = t ;
}
return 1 ;
}
int main()
{
while( read_case() )
{
solve_case() ;
}
return 0;
}