最大流增广路(KM算法) HDOJ 1853 Cyclic Tour

题目传送门

 /*
     KM： 相比HDOJ_1533，多了重边的处理，还有完美匹配的判定方法
 */
 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 #include <cstring>
 using namespace std;

 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 int x[MAXN], y[MAXN];
 int w[MAXN][MAXN];
 int visx[MAXN], visy[MAXN];
 int ly[MAXN];
 int n, m, d;

 bool DFS(int u) {
     visx[u] = true;
     for (int i=; i<=n; ++i)   {
         if (!visy[i] && x[u] + y[i] == w[u][i]) {
             visy[i] = true;
             if (ly[i] == - || DFS (ly[i])) {
                 ly[i] = u;  return true;
             }
         }
         else if (x[u] + y[i] > w[u][i]) d = min (d, x[u] + y[i] - w[u][i]);
     }
     return false;
 }

 int KM(void)    {
     for (int i=; i<=n; ++i)   {
         x[i] = -INF;
         for (int j=; j<=n; ++j)   {
             x[i] = max (x[i], w[i][j]);
         }
     }

     memset (ly, -, sizeof (ly));
     memset (y, , sizeof (y));
     for (int i=; i<=n; ++i)    {
         while (true)    {
             memset (visx, false, sizeof (visx));
             memset (visy, false, sizeof (visy));
             d = INF;
             if (DFS (i))    break;
             for (int i=; i<=n; ++i)   {
                 if (visx[i])    x[i] -= d;
             }
             for (int j=; j<=n; ++j)   {
                 if (visy[j])    y[j] += d;
             }
         }
     }

     for (int i=; i<=n; ++i)    {
         if (ly[i] == - || w[ly[i]][i] == -INF) return -;
     }

     int res = ;
     for (int i=; i<=n; ++i)   {
         res += x[i] + y[i];
     }

     return -res;
 }

 int main(void)  {       //HDOJ 1853 Cyclic Tour
     //freopen ("HDOJ_1853.in", "r", stdin);

     while (scanf ("%d%d", &n, &m) == ) {
         if (!n && !m)   break;
         for (int i=; i<=n; ++i)    {
             for (int j=; j<=n; ++j)    w[i][j] = -INF;
         }
         for (int i=; i<=m; ++i)    {
             int u, v, c;    scanf ("%d%d%d", &u, &v, &c);
             if (-c > w[u][v])   w[u][v] = -c;
         }
         printf ("%d\n", KM ());
     }

     return ;
 }