2018年1月19日
ZOJ [P2314] 无源汇点有上下界模版
摘要： 对于有上下界的网络流来说,我们可以分离出必要弧,然后将必要弧切开,两端分别连接源点和汇点,原图有可行解充要于源点或汇点满流. 这样求下来,只能求出可行流 cpp include include include include include include include using namespa 阅读全文
posted @ 2018-01-19 21:38 Mr_Wolfram 阅读(153) 评论(0) 推荐(0)
最小费用最大流模版
摘要： ```cpp include include include include include include using namespace std; const int MAXN=5005,MAXM=50005; int init(){ int rv=0,fh=1; char c=getchar( 阅读全文
posted @ 2018-01-19 09:34 Mr_Wolfram 阅读(109) 评论(0) 推荐(0)