_zidaoziyan的博客

Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 7026 Accepted: 2323DescriptionJamie is a very popular girl and has quite a lot of fr

Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2864    Accepted Submission(s): 1181Special JudgeProblem

二分图的建图方法

Machine ScheduleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7113    Accepted Submission(s): 3564Problem DescriptionAs we all k

其中的知识都是从别人那里复制的,知识自己进行了一下整合二分图的定义:把一个图的顶点划分为两个不相交集 U 和V ，使得每一条边都分别连接U、V中的顶点。如果存在这样的划分，则此图为一个二分图。二分图的一个等价定义是：不含有「含奇数条边的环」的图。交替路：从一个未匹配点出发，依次经过非匹配边、匹配边、非匹配边…形成的路径叫交替路。增广路：从一个未匹配点出发，走交替路，如果途径另一

König定理是一个二分图中很重要的定理，它的意思是，一个二分图中的最大匹配数等于这个图中的最小点覆盖数。如果你还不知道什么是最小点覆盖，我也在这里说一下：假如选了一个点就相当于覆盖了以它为端点的所有边，你需要选择最少的点来覆盖所有的边。比如，下面这个图中的最大匹配和最小点覆盖已分别用蓝色和红色标注。它们都等于3。                                       

Girls and BoysTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9027    Accepted Submission(s): 4159Problem Descriptionthe second

Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7408 Accepted: 3029DescriptionHave you ever read any book about treasure exploration?

50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1971    Accepted Submission(s): 1089Problem DescriptionOn Octor

Fire NetTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Problem DescriptionSuppose that we have a square city with straight streets. A map of a city i