The Perfect Stall（最大二分匹配：匈牙利算法，最大流）

最新推荐文章于 2020-12-21 00:49:42 发布

原创

最新推荐文章于 2020-12-21 00:49:42 发布 · 449 阅读

0 ·

CC 4.0 BY-SA版权

Farmer John新建的奶牛棚遇到了问题，每头奶牛只愿意在特定的棚位产奶。他收集了数据来确定最佳分配，以实现最大的牛奶生产效率。本文探讨了解决此问题的两种方法：匈牙利算法和最大流算法。虽然匈牙利算法被提及但未详细展开，而最大流算法对于作者来说尚不熟悉。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall.

Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.

    Input
    
  
   The input includes several cases. For each case, the first line contains two integers, N (0 <= N <= 200) and M (0 <= M <= 200). N is the number of cows that Farmer John has and M is the number of stalls in the new barn. Each of the following N