费用流spfa,8~11 MLE,求调(玄关

P3381 【模板】最小费用最大流

@[xuyiluo2](/user/756684) Let me see see......
by User_leo @ 2024-01-31 08:49:22


@[xuyiluo2](/user/756684) 讲真的,我从未见过费用流使用dinic的......(不应该用EK吗??在SPFA中同步更新流量啊!)
by User_leo @ 2024-01-31 08:53:37


@[leo20220722](/user/757861) 不都是dinic吗
by Auto_Accepted @ 2024-01-31 08:54:54


@[leo20220722](/user/757861) EK不是时代的眼泪吗
by Auto_Accepted @ 2024-01-31 08:55:13


@[xuyiluo2](/user/756684) wtf,你这有点抽象啊......
by User_leo @ 2024-01-31 08:55:27


@[xuyiluo2](/user/756684) 不是 MCMF 吗?
by bc2_cryeggy @ 2024-01-31 08:57:46


@[xuyiluo2](/user/756684) ```cpp void MCMF() { while (SPFA()) { int x = t; mxflw += in[t]; micst += dis[t] * in[t]; for (int i; x != s; ) { i = pre[x]; e[i].w -= in[t]; e[i ^ 1].w += in[t]; x = e[i ^ 1].to; } } } ```
by bc2_cryeggy @ 2024-01-31 08:58:13


@[xuyiluo2](/user/756684) 你家费用流卡EK????? (卡EK的出题人已经成为时代的眼泪了好不好......)
by User_leo @ 2024-01-31 09:01:01


我相信这种抽象方法的流量与费用不匹配......
by User_leo @ 2024-01-31 09:03:32


换写法去掉了dfs A了,此贴结
by Auto_Accepted @ 2024-01-31 09:06:44


| 下一页