tarjan求强连通分量

dfn记录的是初次访问的时间

low记录的是最小的访问时间

view记录的是访问过几次，0次可以访问，1次时更新low值，2次表示已出栈，不再访问

 

 

2话不说，贴代码，应该只比HYC小牛快上30%左右......很失落.......

 

 

program tarjan; var i,j,k,x,y,time,n,p,q,ans:longint; dfn,low,view,head,next,list,e,map:array[0..100]of longint; function min(a,b:longint):longint; begin if a<b then exit(a) else exit(b); end; procedure dfs(x:longint); var i,j:longint; begin view[x]:=1; inc(list[0]); list[list[0]]:=x; inc(time); dfn[x]:=time; low[x]:=time; j:=head[x]; while j<>0 do begin if view[e[j]]=0 then dfs(e[j]); if view[e[j]]=1 then low[x]:=min(low[x],low[e[j]]); j:=next[j]; end; if low[x]=dfn[x] then begin inc(ans); while list[list[0]]<>x do begin map[list[list[0]]]:=ans; view[list[list[0]]]:=2; dec(list[0]); end; map[list[list[0]]]:=ans; view[list[list[0]]]:=2; dec(list[0]); end; end; begin assign(input,'tarjan.in'); reset(input); assign(output,'tarjan.out'); rewrite(output); read(n,k); for i:=1 to k do begin read(x,y); e[i]:=y; if head[x]=0 then head[x]:=i else begin p:=head[x]; while p<>0 do begin q:=p; p:=next[q]; end; next[q]:=i; end; end; dfs(1); writeln(ans); end.