几乎就是裸的费用流。
对于点(i,j),我们使用拆点法,从(i,j,0)向(i,j,1)连两条边,一条cap为1,cost为-w(i,j),另一条cap为无穷大,cost为0。
再对点(i,j),向(i+1,j),(i,j+1)连边,cap为无穷大,cost为0。
代码上的小细节见下。
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn=505,maxlongint=0x7fffffff,maxm=8005;
struct Edge{
int from,to,cap,flow,cost;
};
vector<Edge> edges;
vector<int> G[maxm];
int used[maxm],dis[maxm],pre[maxm],res[maxm];
int n,m;
int s,t;
int tot;
int map[maxn][maxn];
int where[maxn][maxn][2];
void AddEdge(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});
int m=edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool SPFA(int& flow,int& cost)
{
memset(used,0,sizeof(used));
queue<int> Q;Q.push(s);
for(int i=s+1;i<=t;i++)
dis[i]=maxlongint/3;
dis[s]=0;res[s]=maxlongint/3;res[t]=0;
while(!Q.empty()){
int u=Q.front();Q.pop();used[u]=0;
for(int i=0;i<G[u].size();i++){
Edge e=edges[G[u][i]];
if(e.cap>e.flow&&dis[u]+e.cost<dis[e.to]){
res[e.to]=min(res[u],e.cap-e.flow);
pre[e.to]=G[u][i];
dis[e.to]=dis[u]+e.cost;
if(!used[e.to]){
used[e.to]=1;
Q.push(e.to);
}
}
}
}
if(dis[t]>=maxlongint/3)
return false;
flow+=res[t];
cost+=res[t]*dis[t];
int u=t;
while(u!=s){
edges[pre[u]].flow+=res[t];
edges[pre[u]^1].flow-=res[t];
u=edges[pre[u]].from;
//printf("%d\n",u);
}
return true;
}
void MinCostMaxFlow(int& flow,int& cost)
{
while(SPFA(flow,cost)){
//printf("%d\n",flow);
}
}
void Solve()
{
int flow(0),cost(0);
MinCostMaxFlow(flow,cost);
printf("%d\n",-cost);
}
void MakeGraph()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
where[i][j][0]=++tot;
where[i][j][1]=tot+n*n;
AddEdge(tot,tot+n*n,1,-map[i][j]);
AddEdge(tot,tot+n*n,maxlongint/3,0);
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
if(i!=1)
AddEdge(where[i-1][j][1],where[i][j][0],maxlongint/3,0);
if(j!=1)
AddEdge(where[i][j-1][1],where[i][j][0],maxlongint/3,0);
}
t=2*tot+1;AddEdge(2*tot,t,maxlongint/3,0);
AddEdge(s,where[1][1][0],m,0);
}
void Readdata()
{
freopen("loli.in","r",stdin);
scanf("%d%d",&n,&m);
int a,b,c;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&map[i][j]);
}
int main()
{
Readdata();
MakeGraph();
Solve();
return 0;
}