hdu - 2686 Matrix、 hdu - 3776 Matrix Again 最大费用最大流 拆点

题意：给一个n*n的距阵，每个点都有一个值。问从(0,0)到(n-1, n-1)点（只能从左到右 或 从上到下）再回到(0,0)点（只能从右到左 或 下到上）经过的点的值总和最大是多少？每个点只能走一次。

每个点拆成i， i + n * n  源点出2个方向，汇点进两个方向，所以就是一遍最大费用最大流

建图：sp ： 0   tp：n * n - 1

        i->i + n * n (i, i + n * n, 1, -w)

        i->j (i + n * n, j, 1, 0)

        sp 特殊考虑  考虑边界

最大费用最大流就是求负权的最小费用最大流取反

链接：hdu 2686    hdu 3776

代码一样注意改数据范围

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <sstream>
#define INF 0x3f3f3f3f
using namespace std;

//最小费用最大流模版.求最大费用最大流建图时把费用取负即可。
//无向边转换成有向边时需要拆分成两条有向边。即两次加边。
const int maxn = 2050;
const int maxm = 1000200;
const int inf = 0x3f3f3f3f;

struct Edge {
    int v, cap, cost, next;
}p[maxm << 1];

int e, sumFlow, n, m, sp, tp;
int head[maxn], dis[maxn], pre[maxn];
bool vis[maxn];

void init() {
    e = 0;
    memset(head, -1, sizeof(head));
}

void addEdge(int u, int v, int cap, int cost) {
    p[e].v = v; p[e].cap = cap; p[e].cost = cost;
    p[e].next = head[u]; head[u] = e++;
    p[e].v = u; p[e].cap = 0; p[e].cost = -cost;
    p[e].next = head[v]; head[v] = e++;
}

bool spfa(int s,int t) {
    int u, v;
    queue<int>q;
    memset(vis, false, sizeof(vis));
    memset(pre, -1, sizeof(pre));
    memset(dis, inf, sizeof(dis));
    vis[s] = true;
    dis[s] = 0;
    q.push(s);
    while(!q.empty()) {
        u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i != -1; i = p[i].next) {
            v = p[i].v;
            if(p[i].cap && dis[v] > dis[u] + p[i].cost) {
                dis[v] = dis[u] + p[i].cost;
                pre[v] = i;
                if(!vis[v]) {
                    q.push(v);
                    vis[v] = true;
                }
            }
        }
     }
     if(dis[t] == inf)
         return false;
     return true;
}

int MCMF(int s, int t) {
    int flow = 0; // 总流量
    int minflow, mincost;
    mincost = 0;
    while(spfa(s, t)) {
        minflow = inf + 1;
        for(int i = pre[t]; i != -1; i = pre[p[i^1].v]) {
            if(p[i].cap < minflow) {
                minflow = p[i].cap;
            }
        }
        flow += minflow;
        for(int i = pre[t]; i != -1; i = pre[p[i^1].v]) {
            p[i].cap -= minflow;
            p[i^1].cap += minflow;
        }
        mincost += dis[t] * minflow;
    }
    sumFlow = flow; // 最大流
    return mincost;
}

int mp[35][35];

int main ()
{
    int t, kcase = 0;
    int n;
    while(~scanf("%d", &n) && n) {
        init();
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                scanf("%d", &mp[i][j]);
            }
        }
        sp = 0, tp = n * n - 1;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                int id = i * n + j;
                if(id != sp && id != tp) {
                    addEdge(id, id + n * n, 1, -mp[i][j]);
                    if(j + 1 < n) {
                        addEdge(id + n * n, id + 1, 1, 0);
                    }
                    if(i + 1 < n) {
                        addEdge(id + n * n, id + n, 1, 0);
                    }
                }
                if(id == sp) {
                    addEdge(sp, 1, 1, 0);
                    addEdge(sp, n, 1, 0);
                }
            }
        }
        int ans = -MCMF(sp, tp) + mp[0][0] + mp[n - 1][n - 1];
        printf("%d\n", ans);
    }
    return 0;
}