POJ1149 网络流最大流
摘要：
"POJ1149 网络流最大流" include include include using namespace std; const int N = 1010; struct node{ int v, w, nxt; }edge[N N]; int s[N], fir[N], deep[N], v 阅读全文
posted @ 2019-02-20 19:51 坤sir 阅读(91) 评论(0) 推荐(0) 编辑
posted @ 2019-02-20 19:51 坤sir 阅读(91) 评论(0) 推荐(0) 编辑
