摘要: dinic 网络流 先利用bfs进行分层,然后再在上面跑dfs. 用的是dinic 具体还是看代码把 cpp include include include include include using namespace std; struct node { int point; int value 阅读全文
posted @ 2018-04-27 15:57 Lance1ot 阅读(126) 评论(0) 推荐(0) 编辑