ME4546的专栏

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1569<br />#include<iostream> #include<queue> using namespace std; #define N 2505 #define M 20000 struct Graph { struct node { int v,next,flow; node(){};

http://acm.hdu.edu.cn/showproblem.php?pid=3277 #include using namespace std; #define N 800 #define M 1000000 #define inf 0x7fffffff struct

http://acm.hdu.edu.cn/showproblem.php?pid=3870最小割转最短路#include #include using namespace std; #include #define N 160001 #define M 1500001 #def

<br />http://acm.hdu.edu.cn/showproblem.php?pid=3376<br />#include<iostream> #include<queue> #define N 605*605*2 #define M 605*605*10 using namespace std; int beg,end; struct Graph { struct node { int v,next,w,flow; node(){}; node(int a

<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 23000 struct node { int x,y; }H[N],M[N]; int ch,cm

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1532<br />#include<iostream> #include<queue> using namespace std; #define N 201 #define M 201 struct Graph { struct node { int v,next,w; node(){}; node(int a,int b,int c):next(a),v(b),w(c){

<br />http://acm.hdu.edu.cn/showproblem.php?pid=3395<br />#include<iostream> #include<queue> using namespace std; #define N 205 #define M 40005 int beg,end; struct Graph { struct node { int v,next,w,flow;

<br />http://acm.hdu.edu.cn/showproblem.php?pid=3081<br />#include<iostream> #include<algorithm> using namespace std; #define N 205 #define M 41000 struct Graph { struct node { int v,next,flow; node()

#define M 1000 int 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]

http://acm.hdu.edu.cn/showproblem.php?pid=3657 #include using namespace std; #define N 2550 #define M 2000000 #define inf 0x7fffffff struct