POJ 1459(EK)

这题是学着小媛学姐写的..

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<queue>
 #include <climits>
 using namespace std;
 #define N 120

 int n, np, nc, m;
 int cap[N][N];
 int EK(int s, int t)
 {
     queue<int> q;
     int flow[N][N];
     int low[N];
     int u,v,maxflow=;
     int pre[N];
     memset(flow,,sizeof(flow));
     while()
     {
         q.push(s);
         memset(low,,sizeof(low));
         low[s] = INT_MAX;
         while(!q.empty())
         {
             u = q.front();
             q.pop();
             for(v = ; v <= t; v ++)
             {
                 if(!low[v] && cap[u][v] > flow[u][v])
                 {
                     q.push(v);
                     low[v] = min(low[u], cap[u][v] - flow[u][v]);
                     pre[v] = u;
                 }
             }
         }
         if(low[t] == ) break;
         for(u = t; u != s; u = pre[u])
         {
             flow[pre[u]][u] += low[t];
             flow[u][pre[u]] -= low[t];
         }
         maxflow += low[t];
     }
     return maxflow;
 }
 int main()
 {
     char ch;
     int from, to, len, ans;
     while(~scanf("%d%d%d%d",&n,&np,&nc,&m))
     {
         memset(cap, , sizeof(cap));
         while(m--)
         {
             scanf(" (%d,%d)%d", &from, &to, &len);
             cap[from][to] = len;
         }
         while(np--)
         {
             scanf(" (%d)%d",&from, &len);
             cap[n+][from] = len;
         }
         while(nc--)
         {
             scanf(" (%d)%d",&from, &len);
             cap[from][n+] = len;
         }
         ans = EK(n+, n+);
         printf("%d\n",ans);
     }
     return ;
 }