最小费用最大流

最小费用最大流

https://www.cnblogs.com/J-william/p/6506067.html
http://codevs.cn/problem/1227/
//http://www.mamicode.com/info-detail-351680.htm

#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<set>
#define MAX_N 55
#define MAX_V 6000
#define INF 1008611
using namespace std;
int K,N;int a[MAX_N][MAX_N];int V=0;
struct edge{int to,cap,cost,rev;};
vector<edge> G[MAX_V];
int dist[MAX_V];int prevv[MAX_V],preve[MAX_V];
void add_edge(int from,int to,int cap,int cost)
{
    G[from].push_back((edge){to,cap,cost,G[to].size()});
    G[to].push_back((edge){from,0,-cost,G[from].size()-1});
}
char cc;
int min_cost_flow(int s,int t,int f)
{
    int res=0;
    while(f>0)
    {
        fill(dist,dist+V,INF);
        dist[s]=0;
        bool update=1;
        while(update)
        {
            update=0;
            for(int v=0;v<V;v++)
            {
                if(dist[v]==INF)continue;
                for(int i=0;i<G[v].size();i++)
                {
                    edge &e=G[v][i];
                    if(e.cap>0&&dist[e.to]>dist[v]+e.cost)
                    {
                        dist[e.to]=dist[v]+e.cost;
                        prevv[e.to]=v;
                        preve[e.to]=i;
                        update=1;
                    }
                }
            }
        }
        if(dist[t]==INF)return -1;
        int d=f;
        for(int v=t;v!=s;v=prevv[v])d=min(d,G[prevv[v]][preve[v]].cap);
        f-=d;
        res+=d*dist[t];
        for(int v=t;v!=s;v=prevv[v])
        {
            edge &e=G[prevv[v]][preve[v]];
            e.cap-=d;
            G[v][e.rev].cap+=d;
        }
    }
    return res;
}

int main()
{
    cin>>N>>K;
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            cin>>a[i][j];
    V=N*N*2+1;
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
        {
            int v=(i*N+j)*2;
            int u=v+1;
            add_edge(v,u,1,-a[i][j]);
            add_edge(v,u,INF,0);
            if(i!=N-1)
                add_edge(u,((i+1)*N+j)*2,INF,0);
            if(j!=N-1)
                add_edge(u,u+1,INF,0);
            add_edge(u,V-1,INF,0);
        }
    cout<<-min_cost_flow(0,V-1,K)<<endl;
    return 0;
}