摘要: vector<int>e[maxn]; int n,m; int inscc[maxn]; int low[maxn],dfn[maxn]; stack<int>stk; int instk[maxn]; int tot,cnt; vector<int>scc[maxn]; void dfs(int 阅读全文
posted @ 2025-09-18 17:08 Marinaco 阅读(6) 评论(0) 推荐(0)
//雪花飘落效果