Blog of RuSun

\begin {array}{c} \mathfrak {One Problem Is Difficult} \\\\ \mathfrak {Because You Don't Know} \\\\ \mathfrak {Why It Is Diffucult} \end {array}

dinic/spfa 与 ek/dijkstra(即 Primal-Dual 原始对偶算法)。复杂度与流量和找增广路的复杂度成线性关系。

最大费用只需将最短路都换成最长路即可。

阅读全文 »