UOJ 1497 最大获利(最大密度子图变形)

胡泊涛论文题

注意要连双向边。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
//const double eps = 1e-8;
const int maxn = 5005;
const int maxm = 500005;
namespace MF{
    static const int N = 1000005;
    static const int M = 20000005;
    static const lint inf = 0x3f3f3f3f;
    int he[N],ne[M],ver[M],d[N];
    lint edge[M];
    int s,t,tot;
    queue<int> que;
    void init( int n ){
        for( int i = 0;i <= n;i++ ){
            he[i] = 0;
        }
        tot = 1;
    }
    void add( int x,int y,lint z ){
        ver[++tot] = y; ne[ tot ] = he[x]; he[x] = tot; edge[ tot ] = z;
        ver[++tot] = x; ne[tot] = he[y]; he[y] = tot;edge[tot] = 0;
    }
    bool bfs(){
        memset( d,0,sizeof( d ) );
        while( que.size() ) que.pop();
        que.push( s );
        d[s] = 1;
        while( que.size() ){
            int x = que.front();
            que.pop();
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure];
                if( edge[cure]  && !d[y] ){
                    que.push( y );
                    d[ y ] = d[x] + 1;
                    if( y == t ) return 1;
                }
            }
        }
        return 0;
    }
    lint dfs( int x,lint flow ){
        if( x== t ) return flow;
        lint rest = flow,k;
        for( int cure = he[x];cure && rest;cure = ne[cure] ){
            int y = ver[cure];
            if( edge[cure]  && d[ y ] == d[x] + 1 ){
                k = dfs( y,min( rest,edge[cure] ) );
                if( !k ) d[ y ] = 0;
                edge[cure] -= k;
                edge[ cure^1 ] += k;
                rest -= k;
            }
        }
        return flow - rest;
    }
    lint max_flow( int x,int y ){
        s = x; t = y;
        lint maxflow = 0;
        lint flow = 0;
        while( bfs() )
            while( flow = dfs( s,inf ) ) maxflow += flow;
        return maxflow;
    }
}
int a[maxn],u[maxm],v[maxm],w[maxm],d[maxn];
int main(){
    int n,m,x,y,z;
    scanf("%d%d",&n,&m);
    int S = 0,T = n+1;
    MF::init(T);
    lint sump = 0,sumw = 0;
    for( int i = 1;i <= n;i++ ){
        scanf("%d",&a[i]);
        sump += a[i];
        //a[i] = -a[i];
    }
    lint U = 0;
    for( int i = 1;i <= m;i++ ){
        scanf("%d%d%d",&u[i],&v[i],&w[i]);
        sumw += w[i];
        d[u[i]] += w[i];
        d[v[i]] += w[i];
    }
    U = 2*sump + sumw;
    for( int i = 1;i <= m;i++ ){
        MF::add( u[i],v[i],w[i] );
        MF::add( v[i],u[i],w[i] );
    }
    for( int i = 1;i <= n;i++ ){
        MF::add( S,i,U );
        MF::add( i,T,U+2*a[i]-d[i] );
    }
    lint ans = (U*n -  MF::max_flow(S,T))/2;
    //cout << ans << endl;
     printf("%d\n",ans);
    return 0;
}