poj1273 （最大流）

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std ;

const int N = 222 ;
const int M = 1111 ;
const int INF = 111111111 ;

struct Edge {
    int from , to , cap , next ;
} edge[M<<1] ;
int head[N] , tot ;

void new_edge ( int from , int to , int cap ) {
    edge[tot].from = from ;
    edge[tot].to = to ;
    edge[tot].cap = cap ;
    edge[tot].next = head[from] ;
    head[from] = tot ++ ;
}

struct Max_Flow {
    int s , t ;
    int dis[N] , cur[N] ;
    queue<int> Q ;
    bool bfs ( int n ) {
        int u , v , i ;
        for ( i = 1 ; i <= n ; i ++ ) dis[i] = INF ;
        dis[s] = 0 ; Q.push ( s ) ;
        while ( !Q.empty () ) {
            u = Q.front () ; Q.pop () ;
            for ( i = head[u] ; i != -1 ; i = edge[i].next ) {
                int v = edge[i].to ;
                if ( dis[v] == INF && edge[i].cap ) {
                    dis[v] = dis[u] + 1 ;
                    Q.push ( v ) ;
                }
            }
        }
        return dis[t] != INF ;
    }

    int dfs ( int u , int a ) {
        if ( u == t || a == 0 ) return a ;
        int flow = 0 , f ;
        for ( int& i = cur[u] ; i != -1 ; i = edge[i].next ) {
            int v = edge[i].to ;
            if ( dis[v] == dis[u] + 1 &&(f = dfs(v , min (a,edge[i].cap)))) {
                flow += f ;
                edge[i].cap -= f ;
                edge[i^1].cap += f ;
                a -= f ;
                if ( a == 0 ) break ;
            }
        }
        return flow ;
    }

    int dinic ( int s , int t , int n ) {
        int ret = 0 ;
        this->s = s ; this->t = t ;
        while ( bfs ( n ) ) {
            for ( int i = 1 ; i <= n ; i ++ )
                cur[i] = head[i] ;
            ret += dfs ( s , INF ) ;
        }
        return ret ;
    }
} AC ;

int main () {
    int t , n , m , a , b , c , ca = 0 ;
    while ( scanf ( "%d%d" , &m , &n ) != EOF ) {
        tot = 0 ; memset ( head , -1 , sizeof ( head ) ) ;
        while ( m -- ) {
            scanf ( "%d%d%d" , &a , &b , &c ) ;
            new_edge ( a , b , c ) ;
            new_edge ( b , a , 0 ) ;
        }
        printf ( "%d\n" , AC.dinic ( 1 , n , n ) ) ;
    }
    return 0 ;
}