蓝桥杯算法提高VIP-分分钟的碎碎念-题解(C++代码) by Zfans.

#include <bits/stdc++.h>
using namespace std;
int arr[1000];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
    }
    int ans = 0;
    for (int j = 1; j <= n; ++j) {
        int from = j, count = 1;
        while (arr[from] != 0) {
            from = arr[from];
            count++;
        }
        ans = ans < count ? count : ans;
    }
    cout << ans << "\n";
    return 0;
}