“三分图”的最大匹配,拆点
B A C (食物、牛、饮料)
将人拆点,否则可能会造成同一个人被流无限次访问,限制了点的容量。
/*************************************************************************
> File Name: poj3281.cpp
> Author: cy
> Mail: [email protected]
> Created Time: 2014/9/26 19:49:47
************************************************************************/
#include<iostream>
#include<cstring>
#include <algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 50000+5
#define inf 0x3f3f3f3f
#define INF 0x3FFFFFFFFFFFFFFFLL
#define rep(i,n) for(i=0;i<n;i++)
#define reP(i,n) for(i=1;i<=n;i++)
#define ull unsigned long long
#define ll long long
#define cle(a) memset(a,0