文章分类 - 其他算法

EOJ:Cleaning Shifts

摘要：Cleaning ShiftsTime Limit: 1000MSMemory Limit: 65536KTotal Submits: 75Accepted: 29DescriptionFarmer John's cows, pampered since birth, have reached new heights of fastidiousness. They now require their barn to be immaculate. Farmer John, the most obliging of farmers, has no choice but hire some 阅读全文

posted @ 2011-02-05 21:07 风也轻云也淡阅读(276) 评论(0) 推荐(0)

EOJ:The Stable Marriage Problem

摘要：The Stable Marriage ProblemTime Limit: 1000MSMemory Limit: 65536KTotal Submits: 40Accepted: 11DescriptionThe 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 阅读全文

posted @ 2011-02-04 20:25 风也轻云也淡阅读(301) 评论(0) 推荐(0)