通过SAP求网络流
(求最大流,最小割…)
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100005,maxm = 100005;
struct node
{
int to,next,flow;
node(void){}
node(int a,int b,int c) : to(a),next(b),flow(c){}
}e[maxm * 2];
int d[maxn];
int co[maxn];
int final[maxn],cur[maxn];
int n,m,tot,s,t;
void link(int u,int v,int c)
{
e[++ tot] = node(v,final[u],c),final[u] = tot;
e[++ tot] = node(u,final[v],0),final[v] = tot;
}
int dfs(int now,int flow)
{
if (now == t) return flow;
int use = 0;
for(int i = cur[now];i;i = e[i].next)
{
cur[now] = i;
if (e[i].flow > 0 && d[e[i].to] + 1 == d[now])
{
int tmp = dfs(e[i].to,min(e[i].flow,flow - use));
use += tmp,e[i].flow -= tmp,e[i ^ 1].flow += tmp;
if (flow == use) return use;
}
}
cur[now] = final[now];
if (!(-- co[d[now]])) d[s] = n;
++ co[++ d[now]];
return use;
}
int main()
{
tot = 1;
scanf("%d%d", &n, &m);
s = 1,t = n;
for(int i = 1;i <= m;i ++)
{
int u,v,c;
scanf("%d%d%d", &u, &v, &c);
link(u,v,c);
}
co[0] = n;
int ans = 0;
for(;d[s] < n;) ans += dfs(s,1 << 30);
printf("%d\n", ans);
}
2018.12.28. update 去除当前弧优化(不实用) 增强代码风格
int dfs(int x,int qv)
{
if(x==tt) return qv;
int nw=0;
for(int tp=las[x];tp;tp=tp[nex])
if(v[tp]>0 && d[to[tp]]+1==d[x])
{
int tmp=dfs(to[tp],min(v[tp],qv-nw));
nw+=tmp,v[tp]-=tmp,v[tp^1]+=tmp;
if(qv==nw) return qv;
}
--g[d[x]],++d[x],++g[d[x]];
if(g[d[x]-1]==0) d[ss]=cnt;
return nw;
}
int main()
{
g[0]=cnt;
while(d[ss]<cnt) sum+=dfs(ss,oo);
}