摘要：
#include<iostream>#include<stdio.h>#include<queue>#include<cstring>using namespace std;#define INF 1000000000#define MAXN 1000int a[MAXN];int cap[MAXN][MAXN],flow[MAXN][MAXN],p[MAXN];queue<int>q;int main(){ int n,m; while(cin>>n>>m) { memset(cap,0,sizeof(cap 阅读全文
