随笔分类 -  匹配

POJ-1469 COURSES ( 匈牙利算法 dfs + bfs )
摘要：题目链接： http://poj.org/problem?id=1469 Description Consider a group of N students and P courses. Each student visits zero, one or more than one courses. 阅读全文
posted @ 2016-04-02 20:16 「空白」物语 阅读(395) 评论(0) 推荐(0)