解题思路
最大权闭合图。从原点向每个实验连边,流量为收益;每个实验向所需器材连边,流量为inf;每个器材向汇点连边,流量为成本。然后跑最小割。
代码:
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<queue>
using namespace std;
int hed[500005],nex[2000005],lb[2000005],cap[2000005];
int dep[500005];
int n,m,s=500001,t=500002,lo=1,mx=2147483640;
int dfs(int x,int num){
if(x==t || num==0) return num;
int c=0;
for(int i=hed[x];i!=0;i=nex[i])
if(cap[i] && dep[lb[i]]==dep[x]+1){
int f=dfs(lb[i],min(cap[i],num));
c+=f;
num-=f;
cap[i]-=f;
cap[i^1]+=f;
}
return c;
}
bool bfs(){
memset(dep,0,sizeof(dep));
queue<int>q;
q.push(s);
dep[s]=1;
while(!q.empty()){
int x=q.front();q.pop();
for(int i=hed[x];i!=0;i=nex[i])
if(cap[i] && !dep[lb[i]]){
dep[lb[i]]=dep[x]+1;
q.push(lb[i]);
}
}
return dep[t];
}
int dinic_(){
int c=0;
while(bfs()) c+=dfs(s,mx);
return c;
}
void add(int x,int y,int num){
lo++;
nex[lo]=hed[x];
hed[x]=lo;
lb[lo]=y;
cap[lo]=num;
}
int main(){
int x,ai,bi,ans=0;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&x);
add(i,t,x);add(t,i,0);
}
for(int i=1;i<=m;i++){
scanf("%d%d%d",&ai,&bi,&x);ans+=x;
add(s,i+n,x);add(i+n,s,0);
add(i+n,ai,mx);add(ai,i+n,0);
add(i+n,bi,mx);add(bi,i+n,0);
}
ans=ans-dinic_();
printf("%d",ans);
return 0;
}