随笔分类 - 图论_网络流专题

hdu 3572 Task Schedule（当前弧优化Dinic算法）

摘要：Problem Description Our geometry princess XMM has stoped her study in computational geometry to concentrate on her newly opened factory. Her factory h 阅读全文

posted @ 2018-10-27 14:55 霜雪千年阅读(319) 评论(0) 推荐(1) 编辑

hdu 3549 Flow Problem（最大流入门）

摘要：Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weight 阅读全文

posted @ 2018-10-24 20:19 霜雪千年阅读(331) 评论(0) 推荐(0) 编辑