摘要:
#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int MAXN = 305;int uN, vN;bool g[MAXN][MAXN];int xM[MAXN], yM[MAXN];bool chk[MAXN];bool searchPath(int u){ for(int v = 0; v < vN; v++) if(g[u][v] && !chk[v]) { chk[v] = true; if(yM[v] == -1 | 阅读全文