Loading docs/graph/flow/max-flow.md +2 −3 Original line number Diff line number Diff line Loading @@ -469,7 +469,6 @@ HLPP 推送的条件是 $h(u)=h(v)+1$ ,而如果在算法的某一时刻, $h using namespace std; const int N = 1e4 + 4, M = 2e5 + 5, INF = 0x3f3f3f3f; int n, m, s, t; ``` struct qxx { int nex, t, v; Loading Loading
docs/graph/flow/max-flow.md +2 −3 Original line number Diff line number Diff line Loading @@ -469,7 +469,6 @@ HLPP 推送的条件是 $h(u)=h(v)+1$ ,而如果在算法的某一时刻, $h using namespace std; const int N = 1e4 + 4, M = 2e5 + 5, INF = 0x3f3f3f3f; int n, m, s, t; ``` struct qxx { int nex, t, v; Loading