您在骗人
by 正式AFO @ 2018-11-08 19:44:44
```
int v = e[i].v;
if (!dfn[v]) {
tarjan(v);
low[l] = min(low[v] , low[l]);
}
else if (vis[l]) low[l] = min(low[v] , low[l]);
```
vis[l] - > vis[v]
下面那个 low[l] 是 dfn[l]
by 落影汐雾 @ 2018-11-08 19:47:43
```
if (dfn[l] == low[l]) {
num++;
int v;
do {
v = s.top();
s.pop();
vis[v] = 0;
in[v] = num;
size[num]++;
} while (v != l);
}
```
这里$l$自己的情况没加进去
by 落影汐雾 @ 2018-11-08 19:49:10
@[IMist](/space/show?uid=51525) 不这个地方对了，我的错
by 落影汐雾 @ 2018-11-08 19:50:03
然后好像没错了
by 落影汐雾 @ 2018-11-08 19:50:52
@[IMist](/space/show?uid=51525)
终于AC了，谢谢dalao
by RiverFun @ 2018-11-08 20:15:09