洛谷 p4174 [noi2006] 最大获利 最小割(最大流),最大权闭合子图

题目

洛谷 p4174
建站花费p[i]元,如果a,b两个站都建起来了获利c元,问最大的获利.

题解

首先需要理解最大流求最大权闭合子图,这个我也不说了,又是转载博客.
https://blog.csdn.net/can919/article/details/77603353
然后考虑题目,每一个获利$c$是相当于正权点,每一个成本$p$相当于负权点.
从源点$s$向每一个用户连流量为$c$的边,每一个站向汇点$t$连流量为$p$的边.
至于每一个用户呢,从他向他需要的两个站建流量为$inf$的边(无关).
然后用正权之和减去最小割即可.
谢谢大家.

#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rec register char
#define rel register ll
#define gc getchar
#define pc putchar
#define p32 pc(' ')
#define pl puts("")
/*By Citrus*/
inline int read(){
  int x=0,f=1;char c=gc();
  for (;!isdigit(c);c=gc()) f^=c=='-';
  for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
  return f?x:-x;
  }
template <typename mitsuha>
inline bool read(mitsuha &x){
  x=0;int f=1;char c=gc();
  for (;!isdigit(c)&&~c;c=gc()) f^=c=='-';
  if (!~c) return 0;
  for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
  return x=f?x:-x,1;
  }
template <typename mitsuha>
inline int write(mitsuha x){
  if (!x) return 0&pc(48);
  if (x<0) x=-x,pc('-');
  int bit[20],i,p=0;
  for (;x;x/=10) bit[++p]=x%10;
  for (i=p;i;--i) pc(bit[i]+48);
  return 0;
  }
inline char fuhao(){
  char c=gc();
  for (;isspace(c);c=gc());
  return c;
  }
}using namespace chtholly;
using namespace std;
const int yuzu=5e5,inf=0x3f3f3f3f;
typedef int fuko[yuzu|10];
int n,m,s,t,cnt;
namespace maxflow{
fuko head,cur,dep;
struct edge{int to,next,f;}e[yuzu|10];

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

int bfs(){
queue<int> q;
memset(dep,-1,sizeof dep);
dep[s]=0,q.push(s);
for (;!q.empty();){
  int i,u=q.front();q.pop();
  for (i=head[u];~i;i=e[i].next){
    int v=e[i].to;
    if (!~dep[v]&&e[i].f){
      dep[v]=dep[u]+1;
      q.push(v);
      }
    }
  }return ~dep[t];
}

int dfs(int u,int flow){
if (u==t||!flow) return flow;
int tflow=0;
for (int &i=cur[u];~i;i=e[i].next){
  int v=e[i].to;
  if (dep[v]==dep[u]+1&&e[i].f){
    int nf=dfs(v,min(e[i].f,flow));
    e[i].f-=nf,e[i^1].f+=nf;
    tflow+=nf,flow-=nf;
    if (!flow) break;
    }
  }return tflow;
}

int dinic(){
int ans=0,i;
for (;bfs();ans+=dfs(s,inf)) memcpy(cur,head,sizeof head);
return ans;
}

int main(){
  int i,j;
  n=read(),m=read();
  s=0,t=n+m+1;
  memset(head,-1,sizeof head);
  for (i=1;i<=n;++i) add(s,i,read());
  int sum=0;
  for (i=n+1;i<=n+m;++i){
    int u=read(),v=read(),c=read();
    add(i,t,c),sum+=c;
    add(u,i,inf),add(v,i,inf);
    }
  write(sum-dinic());
  }
}

int main(){
maxflow::main();
}