Gym 102346G G（有关行列关系的建图+最小费用流）

1
题意：n行m列，每次在一列中选一个数，这些数相乘要最大，这些数不能在同一行，输出每列你选了第几行的数
2
建图：每行每列只能取一个数，就相当于行列是拆开的点，因为需要输出的是列的信息，那么源点向每一列建一条流量为1，费用为0的边，而每一行向汇点建一条流量为1，费用为0的边。再对于每个格子，每一列向它这一列的格子建一条流量为1，费用为0的点，而每个格子向它所在的行建一条流量为1，费用为-log(格子上的数)的边。
（ps：将乘积转换成加法可以考虑用log，注意转成double）

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e3+10;
const int maxm=1e5+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);


int n,m;
int s,t;
int a[maxn][maxn];
struct Edge
{
    int from,to,cap,flow;
    double cost;
    int next;
} edge[maxm];
int head[maxm];
int tol;
bool vis[maxn];
double dis[maxn];
int pre[maxn];

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()
{
    queue<int>q;
    for(int i = 0; i<=maxn; i++)
    {
        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;
}
void mincostflow()
{
    int flow = 0;
    double cost = 0;
    while(spfa())
    {
        int minn = inf;
        for(int i = pre[t]; i!=-1; i = pre[edge[i^1].to])
        {
            if(minn > edge[i].cap - edge[i].flow)
            {
                minn = edge[i].cap - edge[i].flow;
            }
        }
        for(int i = pre[t]; i!=-1; i = pre[edge[i^1].to])
        {
            edge[i].flow +=minn;
            edge[i^1].flow -=minn;
            cost += edge[i].cost*minn;
        }
        flow += minn;
    }
}
int ans[maxn];
int main()
{

    while(scd(n)!=EOF)
    {
        tol = 0;
        memset(head,-1,sizeof(head));
        for(int i = 1; i<=n; i++)
        {
            for(int j = 1; j<=n; j++)
            {
                scd(a[i][j]);
            }
        }
        s = 0;
        t = 2*n+1;
        for(int i = 1; i<=n; i++)
        {
            addedge(s,i,1,0);//列
            addedge(i+n,t,1,0);//行
            for(int j = 1; j<=n; j++)
            {
                addedge(i,n+j,1,-log(a[i][j]));
            }
        }
        mincostflow();
        for(int u = 1; u<=n; u++)
        {
            for(int i = head[u]; i!=-1; i=edge[i].next)
            {
                if(edge[i].flow == 1)
                {
                    ans[edge[i].to - n] = u;
                    break;
                }

            }
        }
        for(int i = 1; i<=n; i++)
        {
            printf("%d",ans[i]);
            if(i == n)
                printf("\n");
            else
                printf(" ");
        }
    }
     return 0;

}