题目链接
这是一道经典问题——题记
结果我还WA了几发没找到原因,我们很容易想到这张图的O(N + M)点复杂度的建边,我们把1~N的每个中转站连接流为本身的需求到终点T,然后有M个事件,我们对应的连接到S上去,流为每个事件的价值。
然后就是用一个总的价值去减去最大流,因为最大流跑出来的分为两种情况:(一)、这个中转站是我们要参与进来的;(二)、这个中转站里的费用是我们无意加进来的,实际上是不需要的(这时候肯定是事件产生价值小于了替换它的价值了)。
所以,最后直接用总的价值,减去最大流即可。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(x, y) make_pair(x, y)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 55007, S = 0, maxE = 3.1e5 + 7;
int N, M, head[maxN], cur[maxN], cnt, T;
struct node
{
int u, v, val;
node(int a=0, int b=0, int c=0):u(a), v(b), val(c) {}
};
struct Eddge
{
int nex, to, flow;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int flow)
{
edge[cnt] = Eddge(head[u], v, flow);
head[u] = cnt++;
}
inline void _add(int u, int v, int flow) { addEddge(u, v, flow); addEddge(v, u, 0); }
int deep[maxN];
queue<int> Q;
inline bool bfs()
{
for(int i=0; i<=T; i++) deep[i] = 0;
deep[S] = 1;
while(!Q.empty()) Q.pop();
Q.push(S);
while(!Q.empty())
{
int u = Q.front(); Q.pop();
for(int i=head[u], v, f; ~i; i=edge[i].nex)
{
v = edge[i].to; f = edge[i].flow;
if(f && !deep[v])
{
deep[v] = deep[u] + 1;
Q.push(v);
}
}
}
return deep[T];
}
int dfs(int u, int Dist)
{
if(u == T) return Dist;
for(int &i=cur[u], v, f; ~i; i=edge[i].nex)
{
v = edge[i].to; f = edge[i].flow;
if(f && deep[v] == deep[u] + 1)
{
int di = dfs(v, min(Dist, f));
if(di)
{
edge[i].flow -= di;
edge[i^1].flow += di;
return di;
}
}
}
return 0;
}
inline int Dinic()
{
int ans = 0, tmp;
while(bfs())
{
for(int i=0; i<=T; i++) cur[i] = head[i];
while((tmp = dfs(S, INF))) ans += tmp;
}
return ans;
}
inline void init()
{
cnt = 0;
T = N + M + 1;
for(int i=0; i<=T; i++) head[i] = -1;
}
int main()
{
freopen("profit.in", "r", stdin);
freopen("profit.out", "w", stdout);
scanf("%d%d", &N, &M);
int ans = 0;
init();
for(int i=1, val; i<=N; i++)
{
scanf("%d", &val);
_add(i, T, val);
}
for(int i=1, u, v, w; i<=M; i++)
{
scanf("%d%d%d", &u, &v, &w);
ans += w;
_add(S, i + N, w);
_add(i + N, v, w);
_add(i + N, u, w);
}
ans -= Dinic();
printf("%d\n", ans);
return 0;
}