网络流
文章平均质量分 81
wJs9528-1
这个作者很懒,什么都没留下…
展开
-
hdu 5294 Tricks Device
Tricks Device Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1762 Accepted Submission(s): 458 Problem Description Innocent Wu原创 2015-07-25 18:55:46 · 433 阅读 · 0 评论 -
最大流dinic 模板
//http://blog.csdn.net/u012965890/article/details/38238923 void dinic_bfs(int s) { int f,r; memset(lv,-1,sizeof lv); q[f=r=0]=s; lv[s]=0; while(f<=r) { int k=q[f+转载 2015-07-25 21:05:59 · 531 阅读 · 0 评论 -
Selecting Courses(二分图匹配 Hungary算法)
Selecting Courses Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description It is well known that it is not easy to select courses in the college, for there is usua原创 2016-02-18 20:34:34 · 152 阅读 · 0 评论 -
Going Home(最小费用最大流模板)
A - Going Home Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 2195 Appoint description: Description On a grid map there are n原创 2016-02-18 20:30:01 · 125 阅读 · 0 评论