题目描述 Description
给出一个n*n的矩阵,每一格有一个非负整数Aij,(Aij <= 1000)现在从(1,1)出发,可以往右或者往下走,最后到达(n,n),每达到一格,把该格子的数取出来,该格子的数就变成0,这样一共走K次,现在要求K次所达到的方格的数的和最大
输入描述 Input Description
第一行两个数n,k(1<=n<=50, 0<=k<=10)
接下来n行,每行n个数,分别表示矩阵的每个格子的数
输出描述 Output Description
一个数,为最大和
样例输入 Sample Input
3 1
1 2 3
0 2 1
1 4 2
样例输出 Sample Output
11
数据范围及提示 Data Size & Hint
1<=n<=50, 0<=k<=10
题解
费用流,因为有点权所以拆点。最关键的一点在于怎么处理“取走数”这个做法,将拆点后的首点跟尾点之间连两条边。第一条控制点权,容量为1,花费为点权;第二条用来保证连通性,容量为k,花费为0。然后建源建汇(源点连向(1, 1),容量为k以保证取k个数),跑最大流即可。
代码
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#define maxn 5550
#define maxm 25000
#define Inf 210000000
using namespace std;
struct Edge{
int u, v, cap ,flow, cost;
int next;
}e[maxm];
int fi[maxn], ecnt = 0;
int d[maxn], a[maxn], p[maxn];
bool inq[maxn];
int flow = 0, cost = 0;
int s, t, N;
void add_edge(int u, int v, int cap , int cost) {
e[ecnt] = (Edge){u, v, cap, 0, cost, fi[u]};
fi[u] = ecnt;
ecnt++;
}
bool spfa(int s, int t) {
memset(d, -1, sizeof(d));
memset(inq, 0, sizeof(inq));
d[s] = 0, inq[s] = 1, p[s] = 0, a[s] = Inf;
int q[maxn*100], head = 0, tail = 1;
q[head] = s;
while(head < tail) {
int u = q[head++];
inq[u] = 0;
for(int i = fi[u]; i != -1; i = e[i].next)
if(e[i].cap > e[i].flow && d[e[i].v] < d[u] + e[i].cost) {
d[e[i].v] = d[u] + e[i].cost;
p[e[i].v] = i;
a[e[i].v] = min(a[u], e[i].cap - e[i].flow);
if(!inq[e[i].v]) {
q[tail++] = e[i].v, inq[e[i].v] = 1;
}
}
}
if(d[t] == -1) return false;
flow += a[t], cost += d[t]*a[t];
int u = t;
while(u != s) {
e[p[u]].flow += a[t];
e[p[u]^1].flow -= a[t];
u = e[p[u]].u;
}
return true;
}
int main() {
memset(fi, -1, sizeof(fi));
int x, k;
scanf("%d%d", &x, &k);
int n = x*x;
int num = 0;
for(int i = 1; i <= x; i++)
for(int j = 1; j <= x; j++) {
int c; num++;
scanf("%d", &c);
add_edge(num, num+n, 1, c);
add_edge(num+n, num, 0, -c);
add_edge(num, num+n, k, 0);
add_edge(num+n, num, 0, 0);
if(i != x)
add_edge(num+n, num+x, Inf, 0), add_edge(num+x, num+n, 0, 0);
if(j != x)
add_edge(num+n, num+1, Inf, 0), add_edge(num+1, num+n, 0, 0);
}
N = n*2+2;
s = N-1, t = N;
add_edge(s, 1, k, 0); add_edge(1, s, 0, 0);
add_edge(num+n, t, Inf, 0); add_edge(t, num+n, 0, 0);
while(spfa(s, t));
printf("%d", cost);
return 0;
}