[51nod1325][最大权闭合子图]两棵树的问题

51nod1325

枚举根节点，强制选根节点，把每个点向两棵树上的父亲分别连边，则就是最大权闭合子图问题，然后就没了

Code：

#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=55,INF=1e9;
struct E{
	int vis[N<<3],nxt[N<<3],head[N<<3],c[N<<3],tot;
	E(){tot=0;}
	inline void add(int x,int y,int z){vis[++tot]=y;nxt[tot]=head[x];head[x]=tot;c[tot]=z;}
}tr[2],flw;
inline void add_edge(int x,int y,int z){flw.add(x,y,z);flw.add(y,x,0);}
void dfstr(int v,int fa,int w){
	if(fa) add_edge(v,fa,INF);
	for(int i=tr[w].head[v];i;i=tr[w].nxt[i])
		if(tr[w].vis[i]!=fa) dfstr(tr[w].vis[i],v,w);
}
int val[N],sum=0;
int n,s,t;
inline void build(int rt){
	sum=0;flw.tot=1;memset(flw.head,0,sizeof(flw.head));
	dfstr(rt,0,0);dfstr(rt,0,1);
	for(int i=1;i<=n;i++){
		if(val[i]>0) sum+=val[i],add_edge(s,i,val[i]);
		else add_edge(i,t,-val[i]);
	}
}
int st[N];
inline bool bfs(){
	memset(st,-1,sizeof(st));
	queue<int>q;
	st[s]=1;q.push(s);
	while(!q.empty()){
		int x=q.front();q.pop();
		for(int i=flw.head[x];i;i=flw.nxt[i]){
			int y=flw.vis[i];
			if(st[y]==-1 && flw.c[i]){
				st[y]=st[x]+1;
				q.push(y);
				if(y==t) return 1;
			}
		}
	}
	return 0;
}
int dfs(int v,int flow){
	if(v==t) return flow;
	int res=flow,k;
	for(int i=flw.head[v];i && res;i=flw.nxt[i]){
		int y=flw.vis[i];
		if(st[y]==st[v]+1 && flw.c[i]){
			k=dfs(y,min(res,flw.c[i]));
			if(!k) st[y]=-1;
			res-=k;flw.c[i]-=k;flw.c[i^1]+=k;
			if(!flow) break;
		}
	}
	return flow-res;
}
inline int dinic(){
	int flow,mxflow=0;
	while(bfs())
		while(flow=dfs(s,INF)) mxflow+=flow;
	return mxflow;
}
int main(){
	n=read();s=0,t=n+1;
	for(int i=1;i<=n;i++) val[i]=read();
	for(int x,y,i=1;i<n;i++){
		x=read()+1,y=read()+1;
		tr[0].add(x,y,0);
		tr[0].add(y,x,0);
	}
	for(int x,y,i=1;i<n;i++){
		x=read()+1,y=read()+1;
		tr[1].add(x,y,0);
		tr[1].add(y,x,0);
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		build(i);
		sum-=dinic();
		ans=max(ans,sum);
	}
	cout<<ans<<endl;
	return 0;
}