#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define N 1010
#define INF 0x3f3f3f3f
struct Edge{
int from, to, cap, flow ,cost;
Edge() {}
Edge(int from, int to, int cap, int flow, int cost):from(from), to(to), cap(cap), flow(flow), cost(cost) {}
};
struct MCMF{
int n, m, source, sink;
vector<Edge> edges;
vector<int> G[N];
int d[N], f[N], p[N];
bool vis[N];
void init(int n) {
this->n = n;
for (int i = 0; i <= n; i++)
G[i].clear();
edges.clear();
}
void AddEdge(int from, int to, int cap, int cost) {
edges.push_back(Edge(from, to, cap, 0, cost));
edges.push_back(Edge(to, from, 0, 0, -cost));
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BellmanFord(int s, int t, int &flow, int &cost) {
for (int i = 0; i <= n; i++)
d[i] = INF;
memset(vis, 0, sizeof(vis));
vis[s] = 1; d[s] = 0; f[s] = INF; p[s] = 0;
queue<int> Q;
Q.push(s);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
vis[u] = 0;
for (int i = 0; i < G[u].size(); i++) {
Edge &e = edges[G[u][i]];
if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {
d[e.to] = d[u] + e.cost;
p[e.to] = G[u][i];
f[e.to] = min(f[u], e.cap - e.flow);
if (!vis[e.to]) {
vis[e.to] = true;
Q.push(e.to);
}
}
}
}
if (d[t] == INF)
return false;
flow += f[t];
cost += d[t] * f[t];
int u = t;
while (u != s) {
edges[p[u]].flow += f[t];
edges[p[u] ^ 1].flow -= f[t];
u = edges[p[u]].from;
}
return true;
}
int Mincost(int s, int t) {
int flow = 0, cost = 0;
while (BellmanFord(s, t, flow, cost));
return cost;
}
};
MCMF mcmf;
int main() {
return 0;
}
最小费用最大流---MCMF模版
最新推荐文章于 2020-07-19 15:46:29 发布