77
Flow & Matching (continued): Dinic's Algorithm, Minimum Cut, Min-cost Flow
11/11/20265 bài tập
Nội dung
- Flow & Matching (continued): Dinic's Algorithm, Minimum Cut, Min-cost Flow
- König's Theorem and Hall's Theorem
Tài liệu (4)
Bài tập5
| OJ | Tên bài | Chủ đề | Trạng thái |
|---|---|---|---|
| CSES | Download Speed cses:1694 | ||
| CSES | Police Chase cses:1695 | ||
| CSES | School Dance cses:1696 | ||
| CSES | Distinct Routes cses:1711 | ||
| Codeforces | Petya and Graph codeforces:1082G |