摘要:
题意:二分图最小权匹配。构图:S向左边的点连容量1,费用0的边,右边的点向T连容量1,费用0的边,点之间连容量1,费用为边权的边。最小费用最大流。注意:1.100*100的方格中有10000个点,数组要开大;2.n==0 && m==0 时结束。View Code View Code /*Source CodeProblem: 2195 User: HEU_daoguangMemory: 1172K Time: 94MSLanguage: G++ Result: AcceptedSource Code*/#include <iostream>#include < 阅读全文