摘要：
EK算法基于增广路的思想,易于理解,但由于低效并不被经常使用 cpp include include include include include include using namespace std; const int MAXN=10005,MAXM=100005; int n,m,s,fl 阅读全文
摘要：
二分图带权最小匹配(朴素) 只要换几个不等号的方向就行,不需要变换权值的正负 cpp include include include include include using namespace std; int n,m,wei[105][105],lx[105],ly[105],match[10 阅读全文
摘要：
二分图带权最大匹配的KM算法(朴素版) cpp include include include include include using namespace std; int init(){ int rv=0,fh=1; char c=getchar(); while(c'9'){ if(c==' 阅读全文