摘要：
二分图的定义：二分图是这样一个图，它的顶点可以分类两个集合X和Y，所有的边关联在两个顶点中，恰好一个属于集合Ｘ，另一个属于集合Ｙ。未盖点 ：设Vi是图G的一个顶点，如果Vi 不与任意一条属于匹配M的边相关联，就称Vi 是一个未盖点。交错路：设P是图G的一条路，如果P的任意两条相邻的边一定是一条属于M而另一条不属于M，就称P是一条交错路。可增广路：两个端点都是未盖点的交错路叫做可增广路。最大匹配：图中包含边数最多的匹配称为图的最大匹配。完美匹配： 如果所有点都在匹配边上，称这个最大匹配是完美匹配。最小覆盖：在一个二分图上用最少的点（x 或 y 集合的都行），让每条连接两个点集的边都至少和其中一个 阅读全文
摘要：
Antenna PlacementTime Limit:1000MSMemory Limit:65536KTotal Submissions:5302Accepted:2645DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, 阅读全文
摘要：
DNA repairTime Limit : 5000/2000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionBiologists finally invent techniques of repairing DNA that contains segments causing kinds of inh 阅读全文
摘要：
Muddy FieldsTime Limit:1000MSMemory Limit:65536KTotal Submissions:6798Accepted:2506DescriptionRain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 #include#includeusing namespace std;int n,m,cnt1,cnt2,map[2520][2520],linker[2520],vis[2520];int g1[60][60],g2[60][60],tg 阅读全文
摘要：
奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1836Accepted Submission(s): 798Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另 阅读全文
摘要：
Selecting CoursesTime Limit:1000MSMemory Limit:65536KTotal Submissions:7635Accepted:3367DescriptionIt is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much, and at the beginning 阅读全文
摘要：
Invitation CardsTime Limit:8000MSMemory Limit:262144KTotal Submissions:15889Accepted:5159DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They 阅读全文
摘要：
Treasure ExplorationTime Limit:6000MSMemory Limit:65536KTotal Submissions:5875Accepted:2343DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never kn 阅读全文
摘要：
Popular CowsTime Limit:2000MSMemory Limit:65536KTotal Submissions:19083Accepted:7675DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell 阅读全文
摘要：
Intelligence SystemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 901Accepted Submission(s): 401Problem DescriptionAfter a day, ALPCs finally complete their ultimate intelligence system, the purpose of it is of course for ACM ... ...Now, kzc_tc, t 阅读全文