加油 (•̀ᴗ•́)و ̑̑

#include <iostream>#include <algorithm>#include <cstring>#include <queue>#define INF 999999#define M 201using namespace std;int n,m,pre[M],cap[M][M],flow[M][M],res[M];i...

http://blog.youkuaiyun.com/chenzhenyu123456/article/details/46431763

#include <iostream>#include <vector>#include <queue>#define MAX 5000#define INF 999999using namespace std;typedef pair<int,int> p;//first最短距离 second 顶点编号struct edge{int ...