题意:
给你n个点m条边,求删除某个点之后,强联通分支里面最大的点数最小是多少?
思路:枚举删除每个点,求强联通分量,然后找到最大的强联通分支,保存最小值
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int instack[20008],low[20008],dfn[20008];
bool stack[20008],DFN[20008];
int n,m,top,indx,bet,num[20008],sss[20008],outo[20008];
vector <int> vc[20008];
vector <int> V[20008];
void Init()
{
bet = top = indx = 0;
memset(sss,0,sizeof(sss));
memset(outo,0,sizeof(outo));
memset(stack,false,sizeof(stack));
memset(low,0,sizeof(low));
memset(DFN,false ,sizeof(DFN));
memset(dfn,0,sizeof(dfn));
}
void tarjan(int x,int s)
{
int y;
low[x] = dfn[x] = ++indx;
instack[++top] = x;
DFN[x] = stack[x] = true;
for(int i=0;i<vc[x].size();i++)
{
y = vc[x][i];
if(y == s)continue; // 此处为删点
if(!DFN[y])
{
tarjan(y,s);
low[x] = min(low[x],low[y]);
}
else
if(stack[y])
{
low[x] = min(low[x],dfn[y]);
}
}
if(dfn[x]==low[x])
{
++bet;
do
{
y = instack[top--];
num[y] = bet; //缩点
sss[bet]++;
stack[y] = false;
} while(x!=y);
}
}
int findmax() // 找到最大的强联通分支
{
int sum = 0,ans;
for(int k=1;k<=bet;k++)
sum = max(sum,sss[k]);
if(sum<2)sum = 0;
return sum;
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
int a,b,MAX=0,Max=0;
memset(vc,0,sizeof(vc));
memset(V,0,sizeof(V));
for(int i=0;i<m;i++)
{
scanf("%d%d",&a,&b);
a++;
b++;
vc[a].push_back(b);
}
int ans,mmax = 100000000;;
for(int i=1;i<=n;i++)
{
Init();
for(int j=1;j<=n;j++)
if(!DFN[j]&&j!=i) tarjan(j,i);
//cout<<bet<<endl;
mmax = min(mmax,findmax()); // 在最大的里面找到最小的
}
printf("%d\n",mmax);
}
}