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

最新推荐文章于 2018-11-26 23:36:20 发布

原创

最新推荐文章于 2018-11-26 23:36:20 发布 · 3.4k 阅读

3 ·

CC 4.0 BY-SA版权

文章标签：

#poj

博客介绍了如何利用匈牙利算法解决POJ1274题，该题涉及将n头牛分配到m个房子中，每个牛有其偏好的房子，目标是最大化入住牛的数量。通过算法实现，得出案例的最大入住牛数为4。

The Perfect Stall

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 17895		Accepted: 8143

Description

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 Jo