int find (int u , int low)
{
    int a ;
    if (u == des)
        return low ;
    for (int v = 1 ; v <= n ; v++) {
        if (map[u][v] && dis[v] == dis[u] + 1 && (a = find (v , min (low , map[u][v])))) {
            map[u][v] -= a ;
            map[v][u] += a ;
           // printf ("a=%d\n" , a) ;
            return a ;
        }
    }
    dis[u] = -1 ;//就这句
    return 0 ;
}

• 加了的确过了，不加TLE... (0) 1007783493 2015-07-17 17:42:58