[NOI2006]最大获利 最大权闭合子图

[NOI2006]

• 选一条边就必须选择连着的两个点
• 最大权闭合子图模型

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--) 
using namespace std;
const int inf=1e9;
const int N=1e6;
struct node{int y,v,n;}e[N];
int lin[N],d[N],len=1,ans=0,S,T,n,m,x,y,v;
void LK(int x,int y,int v)
{e[++len].y=y,e[len].v=v,e[len].n=lin[x],lin[x]=len;}
void add(int x,int y,int v)
{LK(x,y,v),LK(y,x,0);}
inline int read(){
	int num=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
	return num;
}
bool bfs(){
	queue<int> q;
	memset(d,0,sizeof(d));
	q.push(S),d[S]=1;
	while(q.size()){
		int x=q.front();q.pop();
		for(int i=lin[x];i;i=e[i].n){
			int y=e[i].y;
			if(!e[i].v||d[y])continue;
			d[y]=d[x]+1;
			q.push(y);
		}
	}return d[T]>0;
}
int dfs(int x,int minf){
	if(x==T)return minf;
	int flow=0,sum=0;
	for(int i=lin[x];i;i=e[i].n){
		int y=e[i].y;
		if(!e[i].v||d[y]!=d[x]+1)continue;
		flow=dfs(y,min(e[i].v,minf));
		if(!flow)d[y]=0;
		sum+=flow,minf-=flow,e[i].v-=flow,e[i^1].v+=flow;
		if(!minf)return sum;
	}return sum;
}
int main()
{
	n=read(),m=read(),S=n+m+1,T=S+1;
	rep(i,1,n){
		x=read();
		add(i,T,x);
	}
	rep(i,1,m){
		x=read(),y=read(),v=read();
		ans+=v;
		add(S,n+i,v);
		add(n+i,x,inf);
		add(n+i,y,inf);
	}
	while(bfs())ans-=dfs(S,inf);
	cout<<ans;
	return 0;
}