摘要：
题意:给出最少栏杆数使狼和羊分离分析:将狼与源点连，羊与汇点连，容量都为无穷，将图的各个相邻点连接，容量为1然后题目就转化成最小去掉多少条边使不连通,即求最小割最大流.// File Name: 3046.cpp// Author: Zlbing// Created Time: 2013/9/10 20:41:04#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define CL(x,v); memset(x, 阅读全文
