P2661 信息传递

图中最小环算法

不断删除图中入度为0的点，最终图中只剩下环，依次跑一遍，求出最小的环

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], in[maxn], vis[maxn];
int ans = 0x7fffffff;
inline int read()
{
    int s = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9'){ if(ch == '-') f = -1; ch = getchar(); }
    while(ch >= '0' && ch <= '9'){ s *= 10; s += ch-'0'; ch = getchar(); }
    return s*f;
}
void update(int x)
{
    vis[x] = 1;
    in[a[x]]--;
    if(!in[a[x]] && !vis[a[x]]) update(a[x]);
}
void dfs(int x,int s,int step)
{
    if(x == s && step){
        ans = min(ans,step);
        return ;
    }
    if(!vis[a[x]]){
        vis[a[x]] = 1;
        dfs(a[x],s,step+1);
    }
}
int main()
{
    int n;
    n = read();
    for(int i = 1; i <= n; i++){
        a[i] = read();
        in[a[i]]++;
    }
    for(int i = 1; i <= n; i++){
        if(!in[i] && !vis[i]) update(i);
    }
    for(int i = 1; i <= n; i++){
        if(!vis[i]) dfs(i,i,0);
    }
    printf("%d\n",ans);
    return 0;
}

并查集求法

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int d[maxn], prt[maxn];
int ans = 0x7fffffff;
inline int read()
{
    int s = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9'){ if(ch == '-') f = -1; ch = getchar(); }
    while(ch >= '0' && ch <= '9'){ s *= 10; s += ch-'0'; ch = getchar(); }
    return s*f;
}
int getpa(int x)
{
    if(x != prt[x]){
        int tmp = prt[x];
        prt[x] = getpa(prt[x]);
        d[x] += d[tmp];
    }
    return prt[x];
}
void solve(int x,int y)
{
    int fx = getpa(x), fy = getpa(y);
    if(fx != fy){
        prt[fx] = fy;
        d[x] = d[y]+1;
    }
    else ans = min(ans,d[x]+d[y]+1);
}
int main()
{
    int n, x;
    n = read();
    for(int i = 1; i <= n; i++) prt[i] = i;
    for(int i = 1; i <= n; i++){
        x = read();
        solve(i,x);
    }
    printf("%d\n",ans);
    return 0;
}