【网络流】hdu3879 Base Station

题意；（包括题解转载自starfall512.com/?p=361大神的博客）题目里说：有n座城市，要建base station。建立base station,每座城市的花费分别是pi。对于某对城市a,b，如果两座城市都建了base station,那么就能收益c。问怎么建站使得收益最多。
难度：3
题解：对于题目给的没对城市a,b,收益c，都当作网络流中的一个点，组成点集(mm)对于所有base station都是网络流中的点，组成点集(nn)建边：S->mm，容量为收益；nn->T,容量为基站的费用，对于mm集合中每一个点（m'），都对应两座城市a,b。连边m'->a,m'->b，容量为inf。最终结果就是nn点所有的收益和-最大流(S,T)。

#include<cstdio>
#include<cstring>
#include<iostream>
#define maxn 205000
#define maxm 2050000
#define inf 2000000000
using namespace std;
int gap[maxn],dis[maxn],pre[maxn],cur[maxn];
int n,NV,m;
struct Edge {
    int v,val;
    int next;
    Edge(){}
    Edge( int V , int NEXT , int W = 0 ):v(V),next(NEXT),val(W){}
}edge[maxm];
int maxflow;
int cnt_edge,head[maxn];
void Insert_Edge( int u , int v , int flow = 0 ) {
    edge[cnt_edge] = Edge(v,head[u],flow);
    head[u] = cnt_edge++;
    edge[cnt_edge] = Edge(u,head[v]);
    head[v] = cnt_edge++;
}
void Init() {
    cnt_edge = 0;
    memset(head,-1,sizeof(int)*(NV+1));
}
int Sap( int st, int en )
{
    memset(dis,0,sizeof(int)*( NV+1));
    memset(gap,0,sizeof(int)*( NV+1));
    for( int i  = 0 ; i <  NV ; i++ )
        cur[i] = head[i];
    int u = pre[st] = st,maxflow = 0,aug = inf;
    gap[0] = NV;
    while( dis[st] < NV )
    {
loop:    for( int &i = cur[u]; i != -1 ; i = edge[i].next ) {
            int v =edge[i].v;
            if( edge[i].val && dis[u] == dis[v]+1) {
                aug = aug <  edge[i].val? aug: edge[i].val;
                pre[v] = u;
                u = v;
                if( v == en ) {
                    maxflow += aug;
                    for( u = pre[u]; v != st ; v = u,u = pre[u] ) {
                         edge[cur[u]].val -= aug;
                         edge[cur[u]^1].val += aug;
                    }
                    aug = inf;
                }
                goto loop;
            }
        }
        int mindis =  NV;
        for( int i =  head[u]; i != -1 ; i =  edge[i].next ) {
            int v =  edge[i].v;
            if(  edge[i].val && mindis > dis[v] ) {
                cur[u] = i;
                mindis = dis[v];
            }
        }
        if( --gap[dis[u]] == 0 ) break;
        gap[ dis[u] = mindis+1 ]++;
        u = pre[u];
    }
    return maxflow;
}
int main() {
    while( scanf("%d%d",&n,&m) != EOF ) {
        NV = 2 + n + m;
        Init();
        int st = 0;
        int en = NV - 1;
        int cmp = 0;
        for( int i = 1 ; i <= n ; i++ ) {
            int tp;
            scanf("%d",&tp);
            Insert_Edge(i+m,en,tp);
        }
        for( int i = 1 ; i <= m ; i++ ) {
            int u,v,c;
            scanf("%d%d%d",&u,&v,&c);
            Insert_Edge(st,i,c);
            cmp += c;
            Insert_Edge(i,u+m,inf);
            Insert_Edge(i,v+m,inf);
        }
        printf("%d\n",-Sap(st,en)+cmp);
    }
    return 0;
}