【网络流24题】P4174 [NOI2006] 最大获利 最大权闭合子图

思路：将题中的点和边都看成事件。由于选边的时候要选成对的点，且边事件依赖于点事件的发生，满足闭合图的性质。
建图：建立源点，连向有正贡献的边事件（也看成一个点），流量为对应贡献，这个点再向依赖的点连流量为inf的边，依赖点是负贡献，它们各自向汇点连流量为负贡献的绝对值的边。这个时候对这个二分图跑求一个最小割，即是最小损失，然后用正贡献和-最小损失即是答案。
关于正确性，
如果割掉用户边，就相当于减少了收益，可看成损失。
若割掉了中转站的边，相当于付出了代价，看成损失。
而流量为inf的边不会被割，也就解决了依赖问题。

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include<sstream>
#include <stack>
#include <set>
#include <bitset>
#include<vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
const int maxn = 2e4+200;
const ll inf=0x3f3f3f3f3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1.0);
const int mod = 1e9+7;
inline int lowbit(int x){return x&(-x);}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
void ex_gcd(ll a,ll b,ll &d,ll &x,ll &y){if(!b){d=a,x=1,y=0;}else{ex_gcd(b,a%b,d,y,x);y-=x*(a/b);}}//x=(x%(b/d)+(b/d))%(b/d);
inline ll qpow(ll a,ll b,ll MOD=mod){ll res=1;a%=MOD;while(b>0){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;}
inline ll inv(ll x,ll p){return qpow(x,p-2,p);}
inline ll Jos(ll n,ll k,ll s=1){ll res=0;rep(i,1,n+1) res=(res+k)%i;return (res+s)%n;}
inline ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch = getchar();}while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0',  ch = getchar();return x*f; }
int dir[4][2] = { {1,0}, {-1,0},{0,1},{0,-1} };

const int V = 6e4+5, E =5e5;

ll head[V], pnt[E], nxt[E], cost[E], f[E], pre[E], node[E],cur[V], e = 0;

ll d[maxn];
ll vis[maxn];
ll flow[maxn];
ll a[maxn];
ll n, m;
ll s,t;
ll maxFlow = 0;
ll minCost = 0;

inline void addedge(ll u, ll v, ll ff, ll money)
{
    pnt[e] = v;
    node[e] = u;
    cost[e] = money;
    f[e] = ff;
    nxt[e] = head[u];
    head[u] = e++;
}

inline void autoAdd(ll u, ll v, ll ff, ll money)
{
    addedge(u,v,ff,money), addedge(v,u,0,-money);
}

inline bool bfs()
{
    rep(i,s,t+2) d[i] = 0;
    queue<ll> q;
    q.push(s);
    d[s] = 1, pre[t] = -1;
    while(!q.empty())
    {
        ll now = q.front();
        q.pop();
        for(ll i = head[now]; i != -1; i = nxt[i])
        {
            ll v = pnt[i];
            ll curFlow = f[i];
            if(!d[v]&&curFlow>0&&now != v)
            {
                d[v] = d[now] + 1;
                q.push(v);
                if(v==t) return 1;
            }
        }
    }
    return d[t];
}

inline ll dfs(ll u, ll low)
{
    if(u==t)
    {
        vis[t] = 1;
        maxFlow += low;
        return low;
    }
    for(ll &i = cur[u]; i!=-1; i=nxt[i])
    {
        ll v = pnt[i];
        if(f[i]>0&&d[v]==d[u]+1)
        {
            ll mi = dfs(v,min(low,f[i]));
            if(mi)
            {
                 f[i] -= mi, f[i^1] += mi;
                 return mi;
            }
        }
    }
    return 0;
}

 void MCMF(int s, int t)
 {
     while(bfs())
     {
        rep(i,s,t) cur[i] = head[i];
        while(1)
        {
            ll tmp = dfs(s,inf);
            if(!tmp) break;
        }
     }
 }

int main()
{
    scanf("%lld%lld",&n,&m);
    mem(head,-1); maxFlow = minCost = 0;
    rep(i,1,n) a[i] = read();
    s = 0, t = n+m+1;
    rep(i,1,n) autoAdd(i,t,a[i],0);
    ll sum = 0;
    rep(i,1,m)
    {
        ll x = read(), y = read(), z = read();
        autoAdd(s,i+n,z,0);
        autoAdd(i+n,x,inf,0);
        autoAdd(i+n,y,inf,0);
        sum += z;
    }
    MCMF(s,t);
    cout<<sum-maxFlow<<endl;

    return 0;
}