2013年7月9日
POJ 3487 The Stable Marriage Problem（稳定婚姻问题 模版题）
摘要： DescriptionThe 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 阅读全文
posted @ 2013-07-09 23:01 Oyking 阅读(484) 评论(0) 推荐(0)
POJ 3683 Priest John's Busiest Day（2-SAT 并输出解）
摘要： DescriptionJohn is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the ... 阅读全文
posted @ 2013-07-09 17:12 Oyking 阅读(398) 评论(0) 推荐(0)