POJ3422 费用流

题意：有一个n＊n的矩阵 总左上角走到右下角 然后一共可以走k次 走的时候取且只能取一次格子里的

值 问可以取得的最大值是多少

解法：将每一个格子都拆成两个点 然后具体连边方法见代码

#include<iostream>
#include<cstdio>
#define maxn 111111
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#define inf 10000000
#define bug puts("bug\n");
#define ll long long
using namespace std;
struct edge
{
    int from,to,cap,flow,cost;
    edge(int a=0,int b=0,int c=0,int d=0,int e=0)
    {
        from=a;to=b;cap=c;flow=d;cost=e;
    }
};
struct mcmf
{
    int n,m,s,t;
    vector<edge> edges;
    vector<int> g[maxn];
    int inq[maxn],d[maxn],p[maxn],a[maxn];
    void init(int n)
    {
        this->n=n;
        for(int i=0;i<n;++i)
            g[i].clear();
        edges.clear();
    }
    void add(int from,int to,int cap,int cost)
    {
        edges.push_back(edge(from,to,cap,0,cost));
        edges.push_back(edge(to,from,0,0,-cost));
        m=edges.size();
        g[from].push_back(m-2);
        g[to].push_back(m-1);
    }
    bool bellmanford(int s,int t,int &flow,int &cost)
    {
        for(int i=0;i<n;++i)
            d[i]=inf;
        memset(inq,0,sizeof(inq));
        d[s]=0;
        inq[s]=1;p[s]=0;a[s]=inf;
        queue<int> Q;
        Q.push(s);
        while(!Q.empty())
        {
            int u=Q.front();Q.pop();
            inq[u]=0;
            for(int i=0;i<g[u].size();++i)
            {
                edge& e=edges[g[u][i]];
                if(e.cap>e.flow&&d[e.to]>d[u]+e.cost)
                {
                    d[e.to]=d[u]+e.cost;
                    p[e.to]=g[u][i];
                    a[e.to]=min(a[u],e.cap-e.flow);
                    if(!inq[e.to])
                        Q.push(e.to),inq[e.to]=1;
                }
            }
        }
        if(d[t]==inf)
            return 0;
        flow+=a[t];
        cost+=d[t]*a[t];
        int u=t;
        while(u!=s)
        {
            edges[p[u]].flow+=a[t];
            edges[p[u]^1].flow-=a[t];
            u=edges[p[u]].from;
        }
        return 1;
    }
    int mincost(int s,int t)
    {
        int flow=0,cost=0;
        while(bellmanford(s,t,flow,cost));
        return cost;
    }
}solve;
int n,m,mp[111][111];
int main()
{
    while(~scanf("%d%d",&n,&m)){
        solve.init(n*n*2+100);
        
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                scanf("%d",&mp[i][j]);
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j){
                int x=(i-1)*n+j;
                solve.add(x,n*n+x,1,-mp[i][j]);
                solve.add(x,n*n+x,m-1,0);
                if(j!=n){
                    solve.add(x,x+1,m,0);
                    solve.add(x+n*n,x+1,m,0);
                }
                if(i!=n){
                    solve.add(x,x+n,m,0);
                    solve.add(n*n+x,x+n,m,0);
                }
            }
        
        solve.add(0,1,m,0);
        solve.add(n*n*2,n*n*2+1,m,0);
        printf("%d\n",-solve .mincost(0,n*n*2+1));
    }
    return 0;
}