摘要:
//题意:一个人匹配一个房子,使人的移动步伐之和最小//思路:利用KM算法计算二分图最大权匹配AC 0MS,算法一如下:CodeCode highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->#include<iostream>#include<cmath>usingnamespacestd;constintMAXN=102*102/2;constintMAX=-1u>>1;typedefstruct{intx,y;}Po 阅读全文