POJ 1087 A Plug for UNIX 最大流

题意：有n个插座，m台设备，每个设备对应一个插头，k个转接器，每个转接器支持某种插座中插某种插头，求不能使用的最小设备数
思路：源点与插座相连，设备与汇点相连，容量都为1，每个设备对应的插座与其相连，容量为1，转接器中对应的插座与转换的插头相连，需要注意的是这个容量为无限大。之后用最大流求出可以使用的最多设备数，转换一下即可得出答案

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 1005;
const int inf = 0x3f3f3f3f;
int n, m, k, vis[maxn], level[maxn], iter[maxn];
struct edge {
	int to, cap, rev;
	edge(int to = 0, int cap = 0, int rev = 0) : to(to), cap(cap), rev(rev) {}
};
vector<edge> g[maxn];
void addedge(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));
}
void bfs(int s)
{
	memset(level, -1, sizeof(level));
	queue<int> q;
	level[s] = 0;
	q.push(s);
	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 && level[e.to] < 0) {
				level[e.to] = level[t] + 1;
				q.push(e.to);
			}
		}
	}
}
int dfs(int v, int t, int f)
{
	if (v == t) return f;
	vis[v] = 1;
	for (int &i = iter[v]; i < g[v].size(); i++) {
		edge &e = g[v][i];
		if (level[v] < level[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				g[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int solve(int s, int t)
{
	int flow = 0;
	for (;;) {
		bfs(s);
		if (level[t] < 0) return flow;
		memset(iter, 0, sizeof(iter));
		int f;
		while ((f = dfs(s, t, inf)) > 0)
			flow += f;
	}
}
int main()
{
	while (cin >> n) {
		map<string, int> plug;
		int cnt = 1;
		for (int i = 0; i < maxn; i++)
			g[i].clear();
		for (int i = 1; i <= n; i++) {
			string s;
			cin >> s;
			addedge(0, cnt, 1);
			plug[s] = cnt++;
		}
		cin >> m;
		int N = 200+m+1;
		for (int i = 1; i <= m; i++) {
			string s, s2;
			cin >> s2 >> s;
			if (plug[s])
				addedge(plug[s], i+200, 1);
			else {
				plug[s] = cnt++;
				addedge(plug[s], i+200, 1);
			}
			addedge(i+200, N, 1);
		}
		cin >> k;
		for (int i = 1; i <= k; i++) {
			string s1, s2;
			cin >> s1 >> s2;
			if (!plug[s1])
				plug[s1] = cnt++;
			if (!plug[s2])
				plug[s2] = cnt++;
			addedge(plug[s2], plug[s1], inf);
		}
		cout << m-solve(0, N) << endl;
	}
	return 0;
}