摘要：有多个发电站 中转站 和用户 多源 多汇的最大流问题 建立源点 和 汇点 将发电站连到源点上将用户连到汇点上求图的最大流#include<iostream>#include<queue>#include<stdio.h>#include<cstring>using namespace std;#define INF 0x7fffffffint cap[503][503],a[503],p[503];int ek(int s,int t,int n){ int f=0; while(1) { queue<int> q; memset(a 阅读全文

摘要：#include<iostream>#include<map>#include<string>#include<stdio.h>#include<cstring>#include<queue>using namespace std;const int INF=0x7fffffff;int cap[503][503],a[503],flow[503][503],p[503];int ek(int s,int t,int n){ memset(flow,0,sizeof(flow)); int f=0; while(1) { 阅读全文

摘要：#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 阅读全文