お晨晓微风☼倾半世阳光

二分图的最大匹配、完美匹配和匈牙利算法 2013-08-01Algorithms二分图匹配, 图论, 算法 这篇文章讲无权二分图（unweighted bipartite graph）的最大匹配（maximum matching）和完美匹配（perfect matching），以及用于求解匹配的匈牙利算法（Hungarian Algorithm）；不讲带权二分图的最佳匹配。 二分图：

Antenna Placement Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6688   Accepted: 3321 Description The Global Aerial Research Centre has been allotted the t

Machine Schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5784    Accepted Submission(s): 2909 Problem Description As we a

Girls and Boys Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7556    Accepted Submission(s): 3460 Problem Description the sec

50 years, 50 colors Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1638    Accepted Submission(s): 894 Problem Description On Octo

过山车 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10975    Accepted Submission(s): 4833 Problem Description RPG girls今天和大家一起去游乐

Air Raid Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3358    Accepted Submission(s): 2207 Problem Description Consider a town w