Forest Program：dfs求所有环的长度

vis[i]=0：未搜到节点i

 vis[i]=1：i在当前搜索路径上

vis[i]=2：i 已经搜过了，以后再遇到不再搜（所有分支都遍历到）

#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#define far(i,t,n) for(int i=t;i<n;++i)
#define pb(a) push_back(a)
#define lowbit(x) x&(-x)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int inf=0x3f3f3f3f;
int mod=998244353;
const int maxn=300010;

vector<int>V[maxn];
int vis[maxn],len[maxn],parent[maxn];
int cnt=0;

void dfs(int pre,int from)
{
    vis[from]=1;
    int sz=V[from].size();
    far(i,0,sz)
    {
        int v=V[from][i];
        if(pre==v||vis[v]==2)
            continue;
        if(vis[v]==1)
        {
            int l=0;
            int now=from;
            while(now!=v)
            {
                ++l;
                now=parent[now];
            }
            l++;
            len[cnt++]=l;
        }
        else
        {
            parent[v]=from;
            dfs(from,v);
        }
    }
    vis[from]=2;
}

int main()
{
    int n,m;
    cin>>n>>m;
    far(i,0,m)
    {
        int f,t;
        scanf("%d%d",&f,&t);
        V[f].pb(t);
        V[t].pb(f);
    }
    for (int i = 1; i <= n; ++i) {
        if (vis[i] == 0) {
            dfs(0, i);
        }
    }
    cout<<cnt<<endl;
      far(i,0,cnt)
        cout<<len[i]<<" ";
    cout<<endl;  
   
}
/*
3 3
1 2
2 3
3 1
*/