传送门:POJ3422
题意:有一个N X N的矩阵,每个点都有对应的值,现在要从左上角走到右下角k次,每次只能往下走或者往右走,但是每个点的值只能获得一次,问最大可获得的值是多少。
思路:典型费用流,由于每个点的值只能获得一次,要拆点限制一下,然后就是因为点略多,加边的时候细心一点就好了。
代码:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<string.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN=5050;
const int MAXM=1000010;
int head[MAXN],pre[MAXN],dis[MAXN],book[MAXN];
int cnt=0,N;//N为点数
struct node{
int to,next,cap,flow,cost;
}edge[MAXM];
void init()
{
cnt=0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,int cost)
{
edge[cnt].to=v;edge[cnt].cap=cap;edge[cnt].flow=0;
edge[cnt].cost=cost;edge[cnt].next=head[u];head[u]=cnt++;
edge[cnt].to=u;edge[cnt].cap=0;edge[cnt].flow=0;
edge[cnt].cost=-cost;edge[cnt].next=head[v];head[v]=cnt++;
}
bool spfa(int s,int t)
{
queue<int>q;
while(!q.empty())q.pop();
for(int i=0;i<=N;i++)
{
dis[i]=inf;
pre[i]=-1;
book[i]=0;
}
dis[s]=0;book[s]=1;q.push(s);
while(!q.empty())
{
int u=q.front();q.pop();book[u]=0;
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(!book[v])
{
book[v]=1;
q.push(v);
}
}
}
}
return pre[t]!=-1;
}
int min_cost_max_flow(int s,int t,int &cost)
{
int flow=0;
cost=0;
while(spfa(s,t))
{
int temp=inf;
for(int i=pre[t];i!=-1;i=pre[edge[i^1].to])
temp=min(temp,edge[i].cap-edge[i].flow);
for(int i=pre[t];i!=-1;i=pre[edge[i^1].to])
{
edge[i].flow+=temp;
edge[i^1].flow-=temp;
cost+=edge[i].cost*temp;
}
flow+=temp;
}
return flow;
}
int w[55][55];
int main()
{
int n,k,source,sink;
init();
cin>>n>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
cin>>w[i][j];
}
source=0,sink=n*n*2;
int tmp=n*n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
addedge((i-1)*n+j,(i-1)*n+j+tmp,1,-w[i][j]);
addedge((i-1)*n+j,(i-1)*n+j+tmp,inf,0);
if(j+1<=n)
{
addedge((i-1)*n+j+tmp,(i-1)*n+j+1,inf,0);
}
if(i+1<=n)
{
addedge((i-1)*n+j+tmp,i*n+j,inf,0);
}
}
}
addedge(source,1,k,0);
N=n*n*2+1;
int cost;
min_cost_max_flow(source,sink,cost);
cout<<-cost;
}