摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=4654stoer-wagner算法 + dfs#include #include #include #include #include using namespace std;#define inf (1 vst[maxn];vector pa , pb;int prim(int n) { memset(vis,0,sizeof(vis)); memset(d,0,sizeof(d)); int mincut = 0 , tmp = -1; s = t = -1; int to... 阅读全文
![](/skins/gray/images/separator.gif)