方品

二分图大讲堂——彻底搞定最大匹配数（最小覆盖数）、最大独立数、最小路径覆盖、带权最优匹配 文本内容框架： §1图论点、边集和二分图的相关概念和性质 §2二分图最大匹配求解 匈牙利算法、Hopcroft-Karp算法 §3二分图最小覆盖集和最大独立集的构造 §4二分图最小路径覆盖求解 §5二分图带权最优匹配求解 Kuhn-Munkers算法 §6小结 每章节都详细地讲解了问题介绍

Description Bessie wants to navigate her spaceship through a dangerous asteroid field inthe shape of an N x N grid (1 Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids

Description Children are used to playing with special cubes with letters written on thecubes' faces. The goal of the game is to compose words using such cubes. If youwant to compose the word "DOG",

二分图最小路径覆盖＝|v|－最大匹配。此题为有向图，切所有边正反向存了两遍，所以结果匹配数要除以2 // // main.cpp // poj3020 // // Created by Fangpin on 15/5/29. // Copyright (c) 2015年 FangPin. All rights reserved. // #include #include #incl

最大团＝补图最大独立集 when 补图是二分图时， 最大团＝补图顶点数－最大匹配 // // main.cpp // poj3692 // // Created by Fangpin on 15/5/29. // Copyright (c) 2015年 FangPin. All rights reserved. // #include #include #include usi

将孩子看做点，两个孩子间存在矛盾关系则连一条边，最后求二分图最大独立集即可// // main.cpp // hdu3829 // // Created by Fangpin on 15/5/29. // Copyright (c) 2015年 FangPin. All rights reserved. // #include #include #include #include

Memphis loves xor very musch.Now he gets an array A.The length of A is n.Now he wants to know the sum of all (lowbit(Ai xor Aj)) (i,j∈[1,n]) We define that lowbit(x)=2k,k is the smallest integer sa