BZOJ1497【最大权闭合图】

/* I will wait for you */

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const int maxn = 200010;
const int maxm = 1010;
const int maxs = 26;
const int inf = 0x3f3f3f3f;
const int P = 1000000007;
const double error = 1e-9;

inline int read()
{
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		  f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
	 	  x = x * 10 + ch - '0', ch = getchar();
	return x * f;
}

struct edge
{
	int v, a, next;
} e[maxn];

int n, m, s, t, cnt, ans, 
	head[maxn], cur[maxn], dis[maxn], q[maxn];

void insert(int u, int v, int a)
{
	e[cnt] = (edge) {v, a, head[u]}, head[u] = cnt++;
	e[cnt] = (edge) {u, 0, head[v]}, head[v] = cnt++;
}

int bfs()
{
	memset(dis, -1, sizeof dis);
	
	int he = 0, ta = 1;
	q[0] = s, dis[s] = 0;
	
	while (he != ta) {
		int u = q[he++];
		for (int i = head[u]; i != -1; i = e[i].next) {
			int v = e[i].v;
			if (e[i].a && dis[v] == -1)
				dis[v] = dis[u] + 1, q[ta++] = v;
		}
	}
	
	return dis[t] != -1;
}

int dfs(int u, int a)
{
	if (u == t) return a;
	
	int f, flow = 0;
	
	for (int i = cur[u]; a && i != -1 ;i = e[i].next) {
		int v = e[i].v;
		if (e[i].a && dis[v] == dis[u] + 1) {
			f = dfs(v, min(a, e[i].a));
			e[i].a -= f, e[i ^ 1].a += f;
			a -= f, flow += f;
			if (e[i].a) cur[u] = i;
		}
	}
	
	if (!flow) dis[u] = -1;
	return flow;
}

int dinic()
{
	while (bfs()) {
		memcpy(cur, head, sizeof head);
		ans -= dfs(s, inf);
	}
}

int main()
{
	n = read(), m = read();
	s = n + m + 1, t = n + m + 2;
	
	memset(head, -1, sizeof head);
	
	for (int i = 1; i <= n; i++) {
		int w = read();
		insert(i, t, w);
	}
	
	for (int i = 1; i <= m; i++) {
		int u = read(), v = read(), w = read();
		insert(n + i, u, inf), insert(n + i, v, inf);
		insert(s, n + i, w), ans += w;
	}

	dinic(), printf("%d\n", ans);	

	return 0;
}