As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are nplanes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ n and fi ≠ i.
We call a love triangle a situation in which plane A likes plane B, plane B likes plane C and plane C likes plane A. Find out if there is any love triangle on Earth.
The first line contains a single integer n (2 ≤ n ≤ 5000) — the number of planes.
The second line contains n integers f1, f2, ..., fn (1 ≤ fi ≤ n, fi ≠ i), meaning that the i-th plane likes the fi-th.
Output «YES» if there is a love triangle consisting of planes on Earth. Otherwise, output «NO».
You can output any letter in lower case or in upper case.
5 2 4 5 1 3
YES
5 5 5 5 5 1
NO
In first example plane 2 likes plane 4, plane 4 likes plane 1, plane 1 likes plane 2 and that is a love triangle.
In second example there are no love triangles.
题意:给定一个数组,i与a[i]间有边,问最终图有无环
代码如下:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5100;
int a[maxn],n;
int main()
{
while (~scanf("%d",&n)){
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
int f=1;
for (int i=1;i<=n;i++){
if (a[a[a[i]]]==i){
f=0;
break;
}
}
if (!f)
printf("yes\n");
else
printf("no\n");
}
return 0;
}