永夜初晗凝碧天

本博客现已全部转移到新地址，欲获取更多精彩文章，请访问http://acshiryu.github.io/

导航

2011年8月2日 #

POJ 1325 Machine Schedule 解题报告

摘要： 分类：图论，最小覆盖点作者：ACShiryu时间：2011-8-2原题：http://poj.org/problem?id=1325参考资料：Matrix67's BlogMachine ScheduleTime Limit:1000MSMemory Limit:10000KTotal Submissions:7612Accepted:3207DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a ve 阅读全文

posted @ 2011-08-02 01:19 ACShiryu 阅读(1338) 评论(3) 推荐(1) 编辑

POJ 1469 COURSES 解题报告

摘要： 分类：图论，最大匹配，二分图作者：ACShiryu时间：2011-8-1原题：http://poj.org/problem?id=1469COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:10733Accepted:4204DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is 阅读全文

posted @ 2011-08-02 00:46 ACShiryu 阅读(804) 评论(0) 推荐(0) 编辑