题目大意: 有 n n n 个人和 n n n 项工作,一人做一项,第 i i i 个人做第 j j j 项工作的代价为 a i , j a_{i,j} ai,j,求最小代价和最大代价。
题解
费用流裸题,最大费用流可以将费用取反转化为最小费用流。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define maxn 210
#define inf 999999999
int n,a[maxn][maxn],S,T;
struct edge{int x,y,z,cost,next;};
edge e[50010];
int first[maxn],len;
void buildroad(int x,int y,int z,int cost)
{
e[++len]=(edge){x,y,z,cost,first[x]};
first[x]=len;
}
int q[maxn],st,ed,f[maxn],fa[maxn];
bool v[maxn];
bool SPFA()
{
memset(fa,0,sizeof(fa));
memset(f,63,sizeof(f));
st=1;ed=2;q[st]=S;
f[S]=0;v[S]=true;
while(st!=ed)
{
int x=q[st++];st=st>T?1:st;
for(int i=first[x];i;i=e[i].next)
{
int y=e[i].y;
if(e[i].z>0&&f[x]+e[i].cost<f[y])
{
f[y]=f[x]+e[i].cost;fa[y]=i;
if(!v[y])v[q[ed++]=y]=true,ed=ed>T?1:ed;
}
}
v[x]=false;
}
return fa[T];
}
void work(int type)
{
memset(first,0,sizeof(first));len=1;
for(int i=1;i<=n;i++)
{
buildroad(S,i,1,0);buildroad(i,S,0,0);
buildroad(i+n,T,1,0);buildroad(T,i+n,0,0);
for(int j=1;j<=n;j++)
buildroad(i,j+n,1,a[i][j]*type),buildroad(j+n,i,0,-a[i][j]*type);
}
int ans=0;
while(SPFA())
{
int min_flow=inf;
for(int i=fa[T];i;i=fa[e[i].x])min_flow=min(min_flow,e[i].z);
for(int i=fa[T];i;i=fa[e[i].x])
e[i].z-=min_flow,e[i^1].z+=min_flow,ans+=min_flow*e[i].cost;
}
printf("%d\n",ans*type);
}
int main()
{
scanf("%d",&n);S=2*n+1,T=S+1;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
work(1),work(-1);
}