题意:
找出一个图的强连通分量
思路:
好像是裸题,就是一个tarjan,不过我没有学过….尴尬
程序:
uses math;
const
maxn=600000;
var
n,m,i,j,p,all,ans,o:longint;
a,next,last,x,y,low,dfn:array [0..maxn] of longint;
v:array [0..maxn] of boolean;
procedure dfs(x:longint);
var
i,j,u:longint;
begin