回顾最小路径覆盖问题的解法:
先将
n
个点拆点为
为什么可以这样做呢?可以发现,上面其实是一个二分图,最大流实际上就是最大匹配数。在这里可以发现,匹配中每连一条边,路径的数量就减
1
,所以得出
可以把上面的思想运用于此题,用最小费用最大流求解此题。
还是一样,先拆点。
1、由源点向所有的
i
点连一条容量为
2、由所有的
3、对于每条边
u−>v
(假设
u<v
),由
u
向
4、由源点向所有的
跑一遍最小费用最大流即为答案。
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read() {
int res = 0; bool bo = 0; char c;
while (((c = getchar()) < '0' || c > '9') && c != '-');
if (c == '-') bo = 1; else res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
return bo ? ~res + 1 : res;
}
const int N = 3005, M = 6e4 + 5, INF = 0x3f3f3f3f;
int n, m, ecnt = 1, nxt[M], adj[N], go[M], cap[M], cost[M], S, T, dis[N],
que[M], len, a[N], Ans;
bool vis[N], walk[N];
void add_edge(int u, int v, int w, int x) {
nxt[++ecnt] = adj[u]; adj[u] = ecnt; go[ecnt] = v;
cap[ecnt] = w; cost[ecnt] = x;
nxt[++ecnt] = adj[v]; adj[v] = ecnt; go[ecnt] = u;
cap[ecnt] = 0; cost[ecnt] = -x;
}
bool spfa() {
int i; que[len = 1] = S;
memset(dis, INF, sizeof(dis)); dis[S] = 0;
memset(walk, 0, sizeof(walk));
for (i = 1; i <= len; i++) {
int u = que[i]; vis[u] = 0;
for (int e = adj[u], v; e; e = nxt[e])
if (cap[e] > 0 && dis[u] + cost[e] < dis[v = go[e]]) {
dis[v] = dis[u] + cost[e];
if (!vis[v]) vis[que[++len] = v] = 1;
}
}
return dis[T] < INF;
}
int dfs(int u, int flow) {
if (u == T) return Ans += dis[T] * flow, flow;
int res = 0, delta; walk[u] = 1;
for (int e = adj[u], v; e; e = nxt[e])
if (cap[e] > 0 && !walk[v = go[e]] && dis[u] + cost[e] == dis[v]) {
delta = dfs(v, min(cap[e], flow - res));
if (delta) {
cap[e] -= delta; cap[e ^ 1] += delta;
res += delta; if (res == flow) break;
}
}
return res;
}
int solve() {
Ans = 0;
while (spfa()) dfs(S, INF);
return Ans;
}
int main() {
int i, x, y, z; n = read(); m = read(); S = 1; T = (n << 1) + 2;
for (i = 1; i <= n; i++) a[i] = read();
for (i = 1; i <= m; i++) {
x = read(); y = read(); z = read();
if (x > y) swap(x, y);
if (z < a[y]) add_edge(x + 1, y + n + 1, 1, z);
}
for (i = 1; i <= n; i++) add_edge(S, i + 1, 1, 0),
add_edge(i + n + 1, T, 1, 0), add_edge(S, i + n + 1, 1, a[i]);
printf("%d\n", solve());
return 0;
}