HDU1507 - Uncle Tom's Inherited Land*

奇偶点匹配（就是国际象棋盘的红黑格子匹配） 求最大匹配 linker数组中保存了匹配关系

注意不要使用 i * m + j 当做下标进行建图会超时

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <vector>
#include <algorithm>
#include <stack>
#include <cmath>
#include <queue>
#include <set>
#define maxn 1010
#define eps (1e-7)
typedef long long ll;
using namespace std;
struct node {
    int x, y, num;
}pt[maxn];
int uN, vN;//u,v数目
int edge[maxn][maxn];
int linker[maxn];
bool used[maxn];
bool dfs(int u) { //从左边开始找增广路径
    int v;
    for(v = 0; v < vN; ++ v) {
        if(edge[u][v] && !used[v]) {
            used[v] = true;
            if(linker[v] == -1 || dfs(linker[v])) {
                //找增广路，反向
                linker[v] = u;
                return true;
            }
        }
    }
    return false;
}
int max_match() {
    int res=0;
    int u;
    memset(linker,-1,sizeof(linker));
    for(u = 0; u < uN; u++) {
        memset(used, 0, sizeof(used));
        if(dfs(u)) res ++;
    }
    return res;
}
int mat[maxn][maxn], dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};//UDLR;
int main() {
    int n, m;
    while (scanf("%d%d", &n, &m) != EOF) {
        if (n == 0 && m == 0) break;
        memset(edge, 0, sizeof(edge));
        memset(mat, 0, sizeof(mat));
        int k;
        scanf("%d", &k);
        int x, y;
        while (k --) {
            scanf("%d%d", &x, &y);
            -- x, -- y;
            mat[x][y] = -1;
        }
        int p = 1;
        for (int i = 0; i < n; ++ i) {
            for (int j = 0; j < m; ++ j) {
                if (mat[i][j] != -1) {
                    mat[i][j] = p;
                    pt[p].x = i, pt[p].y = j, pt[p].num = p;
                    ++ p;
                }
            }
        }
        for (int i = 1; i < p; ++ i) {
            if ((pt[i].x+pt[i].y)%2 == 0) {
                for (int j = 0; j < 4; ++ j) {
                    int nx = pt[i].x + dx[j], ny = pt[i].y + dy[j];
                    if (mat[nx][ny] >= 1) {
                        edge[i-1][mat[nx][ny]-1] = 1;
                        //cout << i << " " << mat[nx][ny] << endl;
                    }
                }
            }
        }
        uN = p-1;
        vN = p-1;
        cout << max_match() << endl;
        for (int i = 0; i < p; ++ i) if (linker[i] != -1) {
            int u = i+1, v = linker[i]+1;
            printf("(%d,%d)--(%d,%d)\n", pt[u].x+1, pt[u].y+1, pt[v].x+1, pt[v].y+1);
        }
        puts("");
    }
}