![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-网络流
文章平均质量分 80
4546love
这个作者很懒,什么都没留下…
展开
-
HDU 1569 方格取数 最小割
<br />http://acm.hdu.edu.cn/showproblem.php?pid=1569<br />#include<iostream>#include<queue>using namespace std;#define N 2505#define M 20000struct Graph { struct node { int v,next,flow; node(){};原创 2011-05-09 16:57:00 · 825 阅读 · 0 评论 -
HDU 3277 Marriage Match III
http://acm.hdu.edu.cn/showproblem.php?pid=3277#includeusing namespace std;#define N 800#define M 1000000#define inf 0x7fffffffstruct原创 2011-08-03 21:04:26 · 1582 阅读 · 0 评论 -
HDU 3870 Catch the Theves
http://acm.hdu.edu.cn/showproblem.php?pid=3870最小割转最短路#include#includeusing namespace std;#include#define N 160001#define M 1500001#def原创 2011-07-23 19:54:51 · 1383 阅读 · 1 评论 -
HDU 3376 拆点 网络流
<br />http://acm.hdu.edu.cn/showproblem.php?pid=3376<br />#include<iostream>#include<queue>#define N 605*605*2#define M 605*605*10using namespace std;int beg,end;struct Graph{ struct node { int v,next,w,flow; node(){}; node(int a原创 2011-05-09 11:01:00 · 1227 阅读 · 0 评论 -
最小费用最大流 HDU 1533
<br />http://acm.hdu.edu.cn/showproblem.php?pid=1533<br />#include<iostream>#include<cstdio>#include<cstring>#include<queue>#include<cmath>using namespace std;#define N 205#define _M 23000struct node{ int x,y;}H[N],M[N];int ch,cm原创 2011-05-08 10:07:00 · 1379 阅读 · 0 评论 -
EK hdu 1532
<br />http://acm.hdu.edu.cn/showproblem.php?pid=1532<br />#include<iostream>#include<queue>using namespace std;#define N 201#define M 201struct Graph{ struct node { int v,next,w; node(){}; node(int a,int b,int c):next(a),v(b),w(c){原创 2011-05-07 18:46:00 · 1076 阅读 · 0 评论 -
HDU 3395 special fish
<br />http://acm.hdu.edu.cn/showproblem.php?pid=3395<br />#include<iostream>#include<queue>using namespace std;#define N 205#define M 40005int beg,end;struct Graph { struct node { int v,next,w,flow;原创 2011-05-11 20:12:00 · 816 阅读 · 0 评论 -
HDU 3081 Marriage Match II 并查集加网络流
<br />http://acm.hdu.edu.cn/showproblem.php?pid=3081<br />#include<iostream>#include<algorithm>using namespace std;#define N 205 #define M 41000struct Graph { struct node { int v,next,flow; node()原创 2011-05-10 14:35:00 · 877 阅读 · 0 评论 -
整理整理
#define M 1000int maze[M][M];int gap[M],dis[M],pre[M],cur[M];int sap(int s,int t,int nodenum) { CC(cur,0);CC(dis,0);CC(gap,0); int u = pre[s] = s,maxflow = 0,aug = -1; gap[0] = nodenum; while(dis[s]原创 2011-05-09 18:12:00 · 600 阅读 · 0 评论 -
HDU 3657 Game
http://acm.hdu.edu.cn/showproblem.php?pid=3657#includeusing namespace std;#define N 2550#define M 2000000#define inf 0x7fffffffstruct原创 2011-08-05 14:17:36 · 1754 阅读 · 2 评论