BZOJ-1486: [HNOI2009]最小圈（二分判定+DFS查负权圈）

#include <cstdio>
#include <algorithm>
#include <cstring>
 
using namespace std ;
 
#define esp 0.0000000001
#define MAXN 3010
 
const double inf = double( 0x7fffffff ) * double( 0x7fffffff ) ;
 
struct edge {
    edge *next ;
    int t ;
    double d ;
    edge(  ) {
        next = NULL ;
    }
} *head[ MAXN ] ;
 
int n , m ;
 
void AddEdge( int s , int t , double d ) {
    edge *p = new( edge ) ;
    p -> t = t , p -> d = d , p -> next = head[ s ] ;
    head[ s ] = p ;
}
 
int cnt[ MAXN ] ;
double dist[ MAXN ] ;
bool f[ MAXN ] , flag , vis[ MAXN ] ;
 
void dfs( int v ) {
    f[ v ] = true ;
    for ( edge *p = head[ v ] ; p ; p = p -> next ) {
        if ( dist[ p -> t ] > dist[ v ] + p -> d ) {
            if ( ! f[ p -> t ] ) {
                dist[ p -> t ] = dist[ v ] + p -> d ;
                dfs( p -> t ) ;
            } else flag = true ;
            if ( flag ) break ;
        }
    }
    f[ v ] = false ;
}
 
bool check(  ) {
    memset( f , false , sizeof( f ) ) ;
    for ( int i = 0 ; i ++ < n ; ) dist[ i ] = 0 ;
    flag = false ;
    for ( int i = 0 ; i ++ < n ; ) {
        dfs( i ) ; if ( flag ) return false ;
    }
    return true ;
}
 
int main(  ) {
    memset( head , 0 , sizeof( head ) ) ;
    double l = inf , r = - inf ;
    scanf( "%d%d" , &n , &m ) ;
    while ( m -- ) {
        int s , t ; double d ; scanf( "%d%d%lf" , &s , &t , &d ) ;
        l = min( l , d ) , r = max( r , d ) ;
        AddEdge( s , t , d ) ;
    }
    while ( r - l > esp ) {
        double mid = ( l + r ) / 2.0 ;
        for ( int i = 0 ; i ++ < n ; ) {
            for ( edge *p = head[ i ] ; p ; p = p -> next ) {
                p -> d -= mid ;
            }
        }
        if ( check(  ) ) l = mid ; else r = mid ;
        for ( int i = 0 ; i ++ < n ; ) {
            for ( edge *p = head[ i ] ; p ; p = p -> next ) {
                p -> d += mid ;
            }
        }
    }
    printf( "%.8f\n" , l ) ;
    return 0 ;
}