摘要：
题意： 最大匹配数 时候等于P解法： 直接匈牙利COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:14735Accepted:5816DescriptionConsider 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 possible to form a committee of exactly P st 阅读全文
摘要：
konig定理 ： 最小点覆盖数=最大匹配要注意的一点是： 一开始A，B都处于0模式，所以所有与0有关的边都不需要考虑了。。Machine ScheduleTime Limit:1000MSMemory Limit:10000KTotal Submissions:9989Accepted:4248DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling 阅读全文