这篇博客介绍了稳定婚姻问题的背景和定义，并提出了一个特殊的问题，即寻找男性最优的稳定婚姻匹配。文章提供了一个输入格式说明，包括男性和女性的偏好列表，要求找到满足稳定条件且对男性最有利的匹配方案。内容包括多组测试用例，每组用例输出匹配的男女组合，按男性名字的字典序排列。
The Stable Marriage Problem
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 2130 | Accepted: 908 |
Description
The stable marriage problem consists of matching members of two different sets according to the member’s preferences for the other set’s members. The input for our problem consists of:
- a set M of n males;
- a set F of n females;
- for each male and female we have a list of all the members of the opposite gender in order of preference (from the most preferable to the least).
A marriage is a one-to-one mapping between males and females. A marriage is called stable, if there is no
最低0.47元/天 解锁文章
3332
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
