题目链接:https://codeforces.com/gym/102346/problem/G
题目大意:给一个n*n矩阵,每一行每一列最多选出一个元素,求他们乘积最大值(n和数字范围都是1~100)
题目思路:应该对每一行每一列只能取一个这种题目很敏感了啊!就是个二分图啊!n个行n个列,源点向每一行连容量为1,费用为0的边,每一列向终点也这么连,然后每一行都向每一列连,需要注意的地方是由于网络流做不了乘法,所以需要转换成加法,那么就可以使用对数,就转换成了加法,最后就是如何寻找对应的列,直接就看那一条边的流量为1,就能知道对应的列了
以下是代码:
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
const int MAXN = 1e3+5;
const int MAXM=1e5+5;
const int inf=0x3f3f3f3f;
struct edge{
int to,next,cap,flow;
double cost;
}edge[MAXM];
int head[MAXM],tol;
int pre[MAXN];
double dis[MAXN];
bool vis[MAXN];
int N;
void init(int n){
N=n;
tol=0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,double cost){
edge[tol].to=v;
edge[tol].cap=cap;
edge[tol].cost=cost;
edge[tol].flow=0;
edge[tol].next=head[u];
head[u]=tol++;
edge[tol].to=u;
edge[tol].cap=0;
edge[tol].cost=-cost;
edge[tol].flow=0;
edge[tol].next=head[v];
head[v]=tol++;
}
bool spfa(int s,int t){
queue<int>q;
rep(i,0,N-1){
dis[i]=99999999999.0;
vis[i]=false;
pre[i]=-1;
}
dis[s]=0;
vis[s]=true;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=false;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(edge[i].cap>edge[i].flow&&dis[v]>dis[u]+edge[i].cost){
dis[v]=dis[u]+edge[i].cost;
pre[v]=i;
if(!vis[v]){
vis[v]=true;
q.push(v);
}
}
}
}
if(pre[t]==-1)return false;
else return true;
}
int minCostMaxFlow(int s,int t,double &cost){
int flow=0;
cost=0;
while(spfa(s,t)){
int Min=inf;
for(int i=pre[t];i!=-1;i=pre[edge[i^1].to]){
if(Min>edge[i].cap-edge[i].flow){
Min=edge[i].cap-edge[i].flow;
}
}
for(int i=pre[t];i!=-1;i=pre[edge[i^1].to]){
edge[i].flow+=Min;
edge[i^1].flow-=Min;
cost+=edge[i].cost*Min;
}
flow+=Min;
}
return flow;
}
int a[MAXN][MAXN];
int n;
int ans[MAXN];
int main()
{
while(~scanf("%d",&n)){
rep(i,1,n){
rep(j,1,n)scanf("%d",&a[i][j]);
}
init(2*n+2);
rep(i,1,n){
addedge(0,i,1,0);
addedge(n+i,2*n+1,1,0);
rep(j,1,n){
addedge(i,n+j,1,-log(a[i][j]));
}
}
double cost;
minCostMaxFlow(0,2*n+1,cost);
rep(u,1,n){
for(int i=head[u];i!=-1;i=edge[i].next){
if(edge[i].flow==1){
ans[edge[i].to-n]=u;
break;
}
}
}
rep(i,1,n){
printf("%d%c",ans[i],i==n?'\n':' ');
}
}
return 0;
}