网络流（c++源码）

网上虽然有网络流的代码但是总是无法编译或者运行出错

我WA N久的竟然是少了个cap[u[][v]!=flow[u][v]

 

 

代码如下：以三为例

#include <iostream>
#include <cmath>
using namespace std;
int n;
int vis[3];
int pre[3];
int flow[3][3]={0,1,2,0,0,1,0,0,0};
int cap[3][3]={0,2,3,0,0,4,0,0,0};
int l[3];
int min(int a,int b);
bool find(int u);
int main()
{
    while(cin>>n){
    int s=0;
    int i;

         for(;;){
                for(i=0;i<n;i++)
                {
                    vis[i]=0;
                    pre[i]=-1;
                   
                }
                vis[0]=1;
     l[n-1]=INT_MAX;
                int u,v;
                if(find(0))
                    {
                          u=pre[n-1];
                          v=n-1;
                          while(v!=s)
                            {
                                     if(cap[u][v]>flow[u][v])
                                       l[u]=min(l[v],cap[u][v]-flow[u][v]);
                                     else
                                       if(cap[v][u]>0)
                                       l[u]=min(l[v],flow[v][u]);
                                       v=u;
                                       u=pre[u];
                            }  
                          u=pre[n-1];
                          v=n-1;                   
                          while(v!=s)
                             {
                                     if(cap[u][v]>flow[u][v])
                                       flow[u][v]+=l[0];
                                     else
                                       if(cap[v][u]>0)
                                         flow[v][u]-=l[0];
                                         v=u;
                                         u=pre[u];
                             }                           
                    }
     else break;
         }
         int ans=0;
         for(i=0;i<n;i++)
           ans+=flow[i][n-1];
           cout<<ans;
    }
    return 0;
}
bool find(int u)
{   
   if(u==(n-1))    
          return 1;
     for(int i=0;i<n;i++)
        if(!vis[i]&&(flow[u][i]>0||flow[i][u]>0)&&(flow[u][i]!=cap[u][i]))
        {
            vis[u]=1;
    if(u==(n-1))    
               return 1;
            pre[i]=u;    
            return find(i);                                                
        }
     return 0;                      
}
int min(int a,int b)
{
    return (a>b?b:a);
}