用于记忆的网络流sap

#include<cstdio>
const int N=30010,inf=~0U>>2;
struct edge{int t,f;edge*nxt,*pair;}*g[N],*d[N];
int n,m,S,T,h[N],gap[N],maxflow;
inline int min(int x,int y){return x<y?x:y;}
inline void add(int s,int t,int f){
  edge*p=new(edge);p->t=t;p->f=f;p->nxt=g[s];g[s]=p;
  p=new(edge);p->t=s;p->f=0;p->nxt=g[t];g[t]=p;
  g[s]->pair=g[t];g[t]->pair=g[s];
}
int sap(int v,int flow){
  if(v==T)return flow;
  int rec=0;
  for(edge*p=d[v];p;p=p->nxt)if(h[v]==h[p->t]+1&&p->f){
    int ret=sap(p->t,min(flow-rec,p->f));
    p->f-=ret;p->pair->f+=ret;d[v]=p;
    if((rec+=ret)==flow)return flow;
  }
  if(!(--gap[h[v]]))h[S]=T;
  gap[++h[v]]++;d[v]=g[v];
  return rec;
}
int main(){
  S=n+1;T=S+1;
  for(gap[0]=T,i=1;i<=T;i++)d[i]=g[i];
  while(h[S]<T)maxflow+=sap(S,inf);
}

以上为大牛手稿，仅为转载