n, flag =int(input()),0
nums =list(map(int,input().split()))
nums =[nums[i]-1for i inrange(n)]for i inrange(n):if nums[nums[nums[i]]]== i: flag =1print("YES"if flag else"NO")
题目描述CF939A Love Triangle解法:(Python)这道题确实是有环无环的判断,但是要是用快慢指针就真的是杀鸡用牛刀了,看了下面的代码是不是觉得这题很机贼~n, flag = int(input()), 0nums = list(map(int, input().split()))nums = [nums[i]-1 for i in range(n)]for i i...