题目
![在这里插入图片描述](https://img-blog.csdnimg.cn/20201017010301861.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2tvc2Zf,size_16,color_FFFFFF,t_70#pic_center)
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
int to,next,value;
}edge[101000];
int tot=1;
int head[1010],dis[1010];
int n,m;
void add_edge(int u,int v,int w){
edge[++tot].to=v;
edge[tot].value=w;
edge[tot].next=head[u];
head[u]=tot;
}
bool bfs(int s){
for(int i=1;i<=n;i++){
dis[i]=-1;
}
queue<int> q;
dis[s]=0;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
for(int i=head[u];i;i=edge[i].next){
int to=edge[i].to;
if(dis[to]==-1&&edge[i].value>0){
dis[to]=dis[u]+1;
q.push(to);
}
}
}
return dis[n]!=-1;
}
int dfs(int s,int exp){
if(s==n) return exp;
int flow=0;
for(int i=head[s];i;i=edge[i].next){
int to=edge[i].to;
if((dis[to]==dis[s]+1)&&edge[i].value>0){
int tmp=dfs(to,min(exp,edge[i].value));
if(!tmp) continue;
exp-=tmp;
flow+=tmp;
edge[i].value-=tmp;
edge[i^1].value+=tmp;
if(!exp) break;
}
}
if(!flow) dis[s]=-1;
return flow;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
int s,t,c;
cin>>s>>t>>c;
add_edge(s,t,c);
add_edge(t,s,0);
}
int ans=0;
while(bfs(1)){
ans+=dfs(1,INF);
}
cout<<ans<<endl;
return 0;
}