最大流
文章平均质量分 82
liluoyu_1016
这个作者很懒,什么都没留下…
展开
-
Drainage Ditches HDU - 1532 最大流 模板
Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa原创 2018-04-19 09:44:12 · 132 阅读 · 0 评论 -
Dual Core CPU POJ - 3469 经典最小割
As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW. The routine consists of原创 2018-04-30 15:16:38 · 285 阅读 · 0 评论 -
求割点
#include #include #include using namespace std; const int M=10000; struct node { int to,next; }e[M]; int dfn[110],low[110]; int head[110],vis[110]; int cnt[110]; int m,ci,root; void add(int u,int原创 2017-11-18 09:34:45 · 142 阅读 · 0 评论 -
Flow Problem HDU - 3549 Dinic
Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. Input The first line of input contains an inte原创 2018-04-19 19:21:40 · 126 阅读 · 0 评论