题目链接 :https://vjudge.net/problem/HDU-4738
题目思路:思路很显然,就是求最小割边
坑点:有重复边,当最后求出来是0时,还需要1个人去,整个图本来就不是连通时,输出0
AC代码
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define N 1100
#define inf 0x3f3f3f3f
int n,m;
int dfn[N];
int low[N];
int first[N];
int bridge;
int edge_num;
int tt;
int vcut[N];
int father[N];
struct edge{
int u,v;
int w;
int next;
int flag;
}e[2*N*N];
void init()
{
memset(first,-1,sizeof(first));
edge_num=0;
tt=0;
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
memset(vcut,0,sizeof(vcut));
for(int i=1;i<=n;++i)
father[i]=i;
}
int find(int x)
{
if(father[x]!=x)
return father[x]=find(father[x]);
re