将题目中的那个式子化简我们可以得到,所要求的就是Σ(i=1,n)Σ(j=1,n)[a[i]=1][a[j]=1]b[i][j] - Σ(i=1,n)c[i],这是一个经典的最大闭权子图模型,我们将其转化为:
1.S->(i,j) 容量b[i][j]
2.(i,j)->i (i,j)-> 容量inf
3.i->T 容量c[i]
然后跑一遍最大流就出来了(我写的好慢。。。):
#include<iostream>
#include<cstdio>
#include<cstring>
#define N 300005
#define M 1600005
#define inf 1000000000
using namespace std;
int n,tot=1,sta,tar,fst[N],pnt[M],len[M],nxt[M],cur[N],h[N],d[N];
int getid(int aa,int bb){ return (aa-1)*n+bb; }
void add(int aa,int bb,int cc){
pnt[++tot]=bb; len[tot]=cc; nxt[tot]=fst[aa]; fst[aa]=tot;
}
bool bfs(){
int head=0,tail=1; h[1]=sta;
memset(d,-1,sizeof(d)); d[sta]=0;
while (head<tail){
int x=h[++head],p; cur[x]=fst[x];
for (p=fst[x]; p; p=nxt[p]) if (len[p]){
int y=pnt[p];
if (d[y]==-1){ d[y]=d[x]+1; h[++tail]=y; }
}
}
return d[tar]!=-1;
}
int dfs(int x,int rst){
if (x==tar || !rst) return rst; int p,flow=0;
for (p=cur[x]; p; p=nxt[p]) if (len[p]){
int y=pnt[p]; if (d[x]+1!=d[y]) continue;
int tmp=dfs(y,min(rst,len[p])); if (!tmp) continue;
flow+=tmp; len[p]-=tmp;
len[p^1]+=tmp; rst-=tmp; if (!rst) break;
}
cur[x]=p; if (!p) cur[x]=fst[x];
if (!flow) d[x]=-1; return flow;
}
int main(){
scanf("%d",&n); int i,j,sum=0; tar=n*(n+1)+1;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++){
int x; scanf("%d",&x); sum+=x;
if (x){ add(0,getid(i,j),x); add(getid(i,j),0,0); }
}
for (i=1; i<=n; i++){
int x; scanf("%d",&x);
if (x){ add(n*n+i,tar,x); add(tar,n*n+i,0); }
}
for (i=1; i<=n; i++)
for (j=1; j<=n; j++){
add(getid(i,j),i+n*n,inf); add(i+n*n,getid(i,j),0);
if (i!=j){ add(getid(i,j),j+n*n,inf); add(j+n*n,getid(i,j),0); }
}
while (bfs()) sum-=dfs(0,inf); printf("%d\n",sum);
return 0;
}
by lych
2015.12.31