HDU2063二分图匹配入门

网址http://acm.hdu.edu.cn/showproblem.php?pid=2063
RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只愿意和linle或LL做partner，PrincessSnow愿意和水域浪子或伪酷儿做partner。考虑到经费问题，boss刘决定只让找到partner的人去坐过山车，其他的人，嘿嘿，就站在下面看着吧。聪明的Acmer，你可以帮忙算算最多有多少对组合可以坐上过山车吗？
学习了这个算法后用这道题练练手。

这种题可以用匈牙利+bfs/dfs求解，也可以用网络流的最大流求解。
首先是匈牙利+dfs
(1)邻接矩阵

#include<iostream>
#include<string>
#include<algorithm>
#include<stdlib.h>
#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
#define N 600+5
#define INF 0x3f3f3f3f
#define mem(arr,a) memset(arr,a,sizeof(arr))
/*********************************/
int cost[510][510];
int match[510], used[510];
int k, g, b;
int dfs(int u){
    for (int i = 1; i <= b; i++){
        if (!used[i] && cost[u][i]){
            int v = i; used[i] = 1;
            int w = match[v];
            if (w == 0 || dfs(w)){
        //      match[u] = v;   不可以这样写，假如u=1,v=1这样写就错了。
                match[v] = u;
                return 1;
            }
        }
    }
    return 0;
}
int hang(){
    int sum = 0;
    for (int i = 1; i <= g; i++){
        mem(used, 0);
        if (dfs(i))
            sum++;
    }
    return sum;
}
int main(){
    while (cin >> k&&k){
        cin >> g >> b;
        mem(cost, 0);
        mem(match, 0);
        for (int i = 0; i < k; i++){
            int a, b;
            cin >> a >> b;
            cost[a][b] = 1;
        }
        cout << hang() << endl;
    }
}

（2）邻接表

#include<iostream>
#include<string>
#include<algorithm>
#include<stdlib.h>
#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
#define N 1000+5
#define INF 0x3f3f3f3f
#define mem(arr,a) memset(arr,a,sizeof(arr))
/*********************************/
vector<int>G[N*2];
int match[N*2], used[510];
int k, g, b;
const int T = 500;
int dfs(int u){
    used[u] = 1;
    for (int i = 0; i < G[u].size(); i++){
        int v = G[u][i];
        int w = match[v];
        if (w == 0 || !used[w] && dfs(w)){
            match[v] = u;
            match[u] = v;
            return 1;
        }
    }
    return 0;
}
int hang(){
    int sum = 0;
    for (int i = 1; i <= g; i++){
        if (match[i] == 0)
        {
            mem(used, 0);
            if (dfs(i))
                sum++;
        }
    }
    return sum;
}
int main(){
    while (cin >> k&&k){
        cin >> g >> b;
        mem(G, 0);
        mem(match, 0);
        for (int i = 0; i < k; i++){
            int a, b;
            cin >> a >> b;
            b += T;
            G[a].push_back(b);
            G[b].push_back(a);
        }
        cout << hang() << endl;
    }
}

最大流

#include<iostream>
#include<string>
#include<algorithm>
#include<stdlib.h>
#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
#define N 1000+5
#define INF 0x3f3f3f3f
#define mem(arr,a) memset(arr,a,sizeof(arr))
/*********************************/
struct edge{
    int to, cap, rev;
};
vector<edge>G[N];
int iter[N];
int ranks[N];
int k, g, b;
const int T = 500;
void add(int from, int to, int cap){
    G[from].push_back(edge{ to, cap, G[to].size() });
    G[to].push_back(edge{ from, 0, G[from].size() - 1 });
}
bool bfs(){
    mem(ranks, -1);
    ranks[0] = 0;
    queue<int> q;
    q.push(0);
    while (!q.empty()){
        int t = q.front(); q.pop();
        for (int i = 0; i < G[t].size(); i++){
            edge&e = G[t][i];
            if (e.cap>0 && ranks[e.to] < 0){
                ranks[e.to] = ranks[t] + 1;
                q.push(e.to);
            }
        }
    }
    if (ranks[N - 1]>0)return 1;
    return 0;
}
int dfs(int x, int flow){
    if (x == N - 1)return flow;
    for (int&i = iter[x]; i < G[x].size(); i++){
        edge&e = G[x][i];
        int a;
        if (e.cap>0 && ranks[e.to] == ranks[x] + 1 && (a = dfs(e.to, min(flow, e.cap)))){
            e.cap -= a;
            G[e.to][e.rev].cap += a; 
                return a;
        }
    }
    return 0;
}
int dinic(){
    int sum = 0;
    G;
    while (bfs()){
        mem(iter, 0);
        while (int a = dfs(0, INF))sum += a;
    }
    return sum;
}
int main(){
    while (cin >> k&&k){
        cin >> g >> b;
        mem(G, 0);
        for (int i = 0; i < k; i++){
            int a, b;
            cin >> a >> b;
            b += T;
            add(a, b, 1);
        }
        for (int i = 1; i <= g; i++){
            add(0, i, 1);
        }
        for (int i = T + 1; i <=T+ b; i++){
            add(i, N - 1, 1);
        }
        cout << dinic() << endl;
    }
}