网络流学习3 Poj#101最大流

题目描述
https://loj.ac/problem/101
这题要用当前弧优化，dinic会卡时间

#include<bits/stdc++.h>
#include<string>
using namespace std;
typedef long long ll;
const int  mod=998244353;
const int inf=0x3f3f3f3f;
const int N=1e4+10;
struct data
    {
        int v;int nxt;ll val;
    }edge[N];
int h[110];int cnt=1;
int s,t;
void add(int u,int v,int val)
    {
        edge[++cnt].v=v;edge[cnt].val=val;
        edge[cnt].nxt=h[u];h[u]=cnt;
        return;
    }
int dep[110],vis[110],cur[110];
int n;int m;
ll maxx=0;
int bfs(){
	memset(dep,inf,sizeof(dep));
	queue<int>q;
	q.push(s);
	dep[s]=0;
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int i=h[u];~i;i=edge[i].nxt){
			int v=edge[i].v;
			if(dep[v]>dep[u]+1&&edge[i].val){
			dep[v]=dep[u]+1;		
			q.push(v);
		}
		}
	}
if(dep[t]!=inf)return 1;
return 0;
}
ll dfs(int u,ll lim)
{
	if(u==t){
		//printf("lim=%d\n");
	return lim;
}
	for(int &i=cur[u];~i;i=edge[i].nxt){
		int v=edge[i].v;
		if(edge[i].val&&dep[v]==dep[u]+1){
			ll flow;
			if(flow=dfs(v,min(edge[i].val,lim))){
			//	printf("u=%d,v=%d\n",u,v);
				edge[i].val-=flow;
				edge[i^1].val+=flow;
				return flow;
			}
		}
	}
	return 0;
}
void maxflow(){
	ll lowflow;
	while(bfs()){
		for(int i=0;i<=n;i++)cur[i]=h[i];
		while(lowflow=dfs(s,inf))maxx+=lowflow;
	}
}
int main()
{
    memset(h,-1,sizeof(h));
    scanf("%d%d%d%d",&n,&m,&s,&t);
       for(int i=1;i<=m;i++){
       	int u,v;
		ll w;
       	scanf("%d%d%lld",&u,&v,&w);
       	add(u,v,w);add(v,u,0);
	   }
        maxflow();
      printf("%lld\n",maxx);
    }