P3376 【模板】网络最大流(Dinic模板)
code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll INFF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9 + 7;
const int M = 1e6 + 5;
const int N = 1e5 + 5;
int n, m, s, t;
// Dinic 每次寻找最短的增广路,并沿着..
原创
2020-09-11 11:25:07 ·
102 阅读 ·
0 评论