HDU 3376 Matrix Again（费用流）

最新推荐文章于 2018-05-19 17:01:43 发布

原创最新推荐文章于 2018-05-19 17:01:43 发布 · 607 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM/ICPC 同时被 2 个专栏收录

198 篇文章

订阅专栏

图论

93 篇文章

订阅专栏

本文介绍了一种解决特定路径寻找问题的方法，通过最大流最小费用算法求解矩阵中从左上角到右下角再返回的最大价值路径。文章详细展示了算法的实现过程，并提供了完整的代码示例。

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3376

题意：给出一个矩阵，从左上角走到右下角，每次只能往右或者往下走，再返回左上角，每次只能往左或者往上走，问所能获得的最大值是多少

思路：每个点拆成两个，对于每个i点连一条边到i + n * n，流量为1，费用为-val[i]，因为有流量的限制，所以每个费用只会算1次，然后对于i点能到的点j，从i + n * n连过去，流量为INF，费用为0，然后j点也做类似处理。注意源点到1号点连边流量为2，且1号点到1 + n * n需要多连一条容量为1，费用为0的边，以保证最大流为2，汇点和2 * n * n点也做类似处理

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

typedef long long ll;

const int MAXN = 750000;
const int MAXM = MAXN << 2;
const int INF = 0x3f3f3f3f;

struct Edge
{
    int to, next, cap, flow, cost;
} edge[MAXM];

int head[MAXN], tol;
int pre[MAXN], dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1

void init(int n)
{
    N = n;
    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 < N; 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;
}

//返回的是最大流，cost存的是最小费用
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 g[700][700];

int main()
{
    int n;
    while (~scanf("%d", &n))
    {
        int s = 0, t = 2 * n * n + 1;
        init(t + 1);

        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                scanf("%d", &g[i][j]);

        addedge(s, 1, 2, 0);
        addedge(1, 1 + n * n, 1, 0);

        addedge(n * n, 2 * n * n, 1, 0);
        addedge(2 * n * n, t, 2, 0);

        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
            {
                addedge((i - 1) * n + j, (i - 1) * n + j + n * n, 1, -g[i][j]);
                if (j < n)
                    addedge((i - 1) * n + j + n * n, (i - 1) * n + j + 1, INF, 0);
                if (i < n)
                    addedge((i - 1) * n + j + n * n, i * n + j, INF, 0);
            }

        int ans;
        minCostMaxflow(s, t, ans);
        cout << -ans << endl;
    }
    return 0;
}