HDU 1569 方格取数(2)（最大独立点集）

题目地址这里写链接内容
题意：中文
思路： 和HDU1565方格取数（1）是一样的，只是数据范围变大了，方格取数（1）解题思路。
总结的位置希望大家赏脸(〃’▽’〃)

#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <iomanip>
#define N 5010
#define M 100010
#define LL __int64
#define inf 0x3f3f3f3f
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
using namespace std;
const LL mod = 1000000007;
int head[N], level[N];
int mapp[60][60];
int n, m, cnt;
struct node {
    int to;
    int cap;//剩余流量
    int next;
}edge[2 * M];
int dir[4][2] = { { 1,0 },{ 0,1 },{ -1,0 },{ 0,-1 } };
bool check(int x, int y) {// 判断是否越界
    if (x>0 && x <= n && y>0 && y <= m)
        return true;
    return false;
}
struct Dinic {
    void init() {
        memset(head, -1, sizeof(head));
        cnt = 0;
    }
    void add(int u, int v, int cap) {//有向图
        edge[cnt].to = v, edge[cnt].cap = cap, edge[cnt].next = head[u], head[u] = cnt++;
        edge[cnt].to = u, edge[cnt].cap = 0, edge[cnt].next = head[v], head[v] = cnt++;//反向边
    }
    bool bfs(int s, int t) {//建立分层图
        memset(level, -1, sizeof(level));
        queue<int>q;
        level[s] = 0;//源点的层次最高
        q.push(s);
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int i = head[u]; i != -1; i = edge[i].next) {
                int v = edge[i].to;
                if (edge[i].cap > 0 && level[v] < 0) {
                    level[v] = level[u] + 1;
                    q.push(v);
                }
            }
        }
        return level[t] == -1;
    }
    int dfs(int u, int t, int num) {//找增广路
        if (u == t) {//找到了汇点返回当前的最小值，在这条路径上分别减去最小值
            return num;
        }
        for (int i = head[u]; i != -1; i = edge[i].next) {
            int v = edge[i].to;
            if (edge[i].cap > 0 && level[u] < level[v]) {
                int d = dfs(v, t, min(num, edge[i].cap));
                if (d > 0) {
                    edge[i].cap -= d;
                    edge[i ^ 1].cap += d;//反向边加值
                    return d;
                }
            }
        }
        return 0;
    }
    int dinic(int s, int t) {//源点和汇点
        int sum = 0, num;
        while (true) {
            if (bfs(s, t)) return sum;
            while (num = dfs(s, t, inf), num > 0) {//当前层次图不断的找增广路
                sum += num;
            }
        }
        return sum;
    }
};
int main() {
    cin.sync_with_stdio(false);
    Dinic dc;
    int sum;
    while (cin >> n >> m) {
        dc.init();
        sum = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                cin >> mapp[i][j];
                sum += mapp[i][j];
            }
        }
        int s = 0, t = n*m + 1;
        for (int i = 1; i <= n; i++) {//奇偶建点法
            for (int j = 1; j <= m; j++) {
                if ((i + j) % 2 == 0) {
                    dc.add(s, (i - 1)*m + j, mapp[i][j]);
                }
                else {
                    dc.add((i - 1)*m + j, t, mapp[i][j]);
                }
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                for (int k = 0; k < 4; k++) {
                    int x = i + dir[k][0];
                    int y = j + dir[k][1];
                    if (check(x, y) && (i + j) % 2 == 0) {
                        dc.add((i - 1)*m + j, (x - 1)*m + y, inf);
                    }
                }
            }
        }
        cout << sum - dc.dinic(s, t) << endl;
    }
    return 0;
}