poj 1273网络流.docVIP

poj 1273网络流 POJ 1273 dinicISAP+GAP+当前弧 题意:现在有m个池塘(从1到m开始编号,1为源点,m为汇点),及n条水渠,给出这n条水渠所连接的池塘和所能流过的水量,求水渠中所能流过的水的最大容量. Input The input includes several cases. For each case, the first line contains two space-separated integers, N (0 = N = 200) and M (2 = M = 200). N is the number of ditches that Farmer John has dug. M is the number of intersections points for those ditches. Intersection 1 is the pond. Intersection point M is the stream. Each of the following N lines contains three integers, Si, Ei, and Ci. Si and Ei (1 = Si, Ei = M) designate the intersections between which this ditch flows. Water will flow through this ditch from Si to Ei. Ci (0 = Ci = 10,000,000) is the maximum rate at which water will flow through the ditch. Output For each case, output a single integer, the maximum rate at which water may emptied from the pond. Sample Input 5 4 1 2 40 1 4 20 2 4 20 2 3 30 3 4 10 Sample Output 50 Dinic #includeiostream #define MAXN 201 using namespace std; struct edge { int st,ed; int next; int c; }e[2*MAXN]; int n,m; int E=0; int head[MAXN],d[MAXN]; bool bfs(int s) { memset(d,-1,sizeof(d)); int que[MAXN],rear=1; que[0]=s; int i,j; d[s]=0; for(i=0;irear;i++) { for(j=head[que[i]];j!=-1;j=e[j].next) { if(d[e[j].ed]==-1e[j].c0) { d[e[j].ed]=d[que[i]]+1; que[rear++]=e[j].ed; } } } if(d[m]0) return 0; return 1; } int dinic(int t,int sum) { if(t==m) return sum; int i; int os=sum; for(i=head[t];i!=-1;i=e[i].next) { if(d[e[i].ed]==d[t]+1e[i].c0) { int a=dinic(e[i].ed,min(sum,e[i].c)); e[i].c-=a; e[i^1].c+=a; sum-= a; } } return os-sum; } int main() { while(scanf(%d%d,n,m)!=EOF) { int i; int a,b,c; E=0; memset(head,-1,sizeof(head)); for(i=1;i=n;i++) {