#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#define N 1e9
using namespace std;
queue<int>q;
int mapp[200][200];
int flow[200][200];
int a[200];
int p[200];
int n,m;
int min(int a,int b)
{
if(a>b)return b;
return a;
}
int max_flow(int be,int en)
{
int f,u,v;
memset(flow,0,sizeof(flow));
f = 0;
while(1)
{
memset(a,0,sizeof(a));
a[be] = N;
q.push(be)......
阅读全文