Codeforces--939A--Love Triangle

题目描述：
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number f i, where 1 ≤ f i ≤ n and f i ≠ 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 f 1, f 2, …, f n (1 ≤ f i ≤ n, f i ≠ i), meaning that the i-th plane likes the f i-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
5
5 5 5 5 1
输出：
YES
NO
题意：
在幼儿园中有 n 个小朋友, 这些小朋友从 1 到 n 标号，每个小朋友都有一个特别想要一起玩的同伴，标号为 i 的小朋友特别希望能够和标号为 fi 的小朋友一起玩, 其中 1 ≤ fi ≤ n 且 fi ≠ i.

如果存在三个小朋友 A, B, C 满足 A 想和 B 玩, B 想和 C 玩，C 想和 A 玩，那么这三个小朋友就被称为一个三人游戏组，给出每个小朋友最想和哪个小朋友一起玩，你需要判断其中是否存在一个三人游戏组
题解：
直接暴力
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 5000 + 5;
int a[maxn];

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i = 1; i <= n; i ++) scanf("%d",&a[i]);
        bool flag = false;
        for(int i = 1; i <= n; i ++){
            if(i == a[a[a[i]]]){
                flag = true;
                break;
            }
        }
        if(flag)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}