网络流
G_rass
这个作者很懒,什么都没留下…
展开
-
hdu 1532
基本的网络流问题,套个模板就ok了,这里给出两种算法,bfs和dfs #include #include #include #include using namespace std; const int N=1100; const int INF=0x3f3f3f3f; struct note { int to; int cap; int rev; }; vector v[原创 2015-09-05 21:56:12 · 312 阅读 · 0 评论 -
uva 12821 Double Shortest Paths
Description Input There will be at most 200 test cases. Each case begins with two integers n, m (1<=n<=500, 1<=m<=2000), the number of caves and passages. Each of the following m lines原创 2015-09-11 22:45:09 · 488 阅读 · 0 评论