摘要： 大意略。思路：求得强连通缩点后，可知是DAG图的最小边覆盖，用二分匹配即可。#include <iostream>#include <cstdlib>#include <cstdio>#include <string>#include <cstring>#include <cmath>#include <vector>#include <queue>#include <algorithm>#include <map>using namespace std;const int 阅读全文