判断有无三个节点的强连通分量 思维题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=5005;
typedef long long ll;
inline int read()
{
    char c=getchar();
    int x=0,f=1;
    while(c<'0'||c>'9')
    {
        if(c=='-')f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9')
    {
        x=x*10+c-'0';
        c=getchar();
    }
    return x*f;
}
int a[5006];
int main()
{
    int n;
    n=read();
    for(int i=1; i<=n; i++)
    {
        int k;
        cin>>k;
        a[i]=k;
    }
    int scc=0;
    for(int i=1; i<=n; i++) {
        if(a[a[a[i]]]==i)scc++;
    }
    if(scc>=1){
        cout<<"YES"<<endl;
    }else{
        cout<<"NO"<<endl;
    }
    return 0;
}