POJ-3422-最大流最小费用

题目大意：给定一张网格图，需要从（1,1）走到（n,n）走k条路，每次走到一个格子上会把它的值变为0并且加到sum上去，问sum的最大值是多少；

题目解析：构图考虑到走一次费用就变成了0，所以一个点要拆成2的点两个点之间有一条边容量为1，另一条容量为k-1,费用为0；因为是最大费用，只要把所有的值变成负的，最后去相反数即可；

AC代码：

#include<iostream>  
#include<cstdio>  
#include<algorithm>  
#include<cstring>  
#include<string>  
#include<queue>  
#include<vector>  
#include<map>  
using namespace std;  
const int MAXN = 60;    
const int MAXM = 100000;    
const int INF = 0x3fffffff;    
struct Edge    
{    
    int to,next,cap,flow,cost;    
} edge[MAXM];    
int head[MAXM],tol;    
int pre[MAXM],dis[MAXM];    
bool vis[MAXM];    
int start, end;  
void init()    
{    
    tol = 0;    
    memset(head,-1,sizeof(head));    
}    
void addedge(int u,int v,int cap,int 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;    
    for(int i = 0; i < MAXM; i++)    
    {    
        dis[i] = INF;    
        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,int &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 n,k,graph[MAXN][MAXN];
int main()
{
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		init();
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				scanf("%d",&graph[i][j]);
		addedge(0,1,k,0);
		addedge(2*n*n,2*n*n+1,k,0);
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				int index=(i-1)*n+j;
				addedge(index,index+n*n,1,-graph[i][j]);
				addedge(index,index+n*n,k-1,0);
				if(j+1<=n)
					addedge(index+n*n,index+1,k,0);
				if(i+1<=n)
					addedge(index+n*n,index+n,k,0);	
			}
		}
		int ans;
		int f=minCostMaxflow(0,2*n*n+1,ans);
		printf("%d\n",-ans);
	}
	return 0;
}