Codeforces/115A.cpp at master · AnikNicks/Codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <string>
#include <streambuf>
#include <fstream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <map>
#include <set>
#include <stdlib.h>
#include <cstdio>
#include <vector>
#include <queue>
#include <utility>
#include <math.h>

using namespace std;
#define pi acos(-1.0)
#define N 1000000
#define ll long long
using namespace std;

//vector < ll > edges[2005];
//bool visited[2005];
//
//void dfs(ll node)
//{
//    cout << node << endl;
//    visited[node]=1;
//    for(ll i=0;i<edges[node].size();i++)
//    {
//        ll v=edges[node][i];
//        if(!visited[v])
//            dfs(v);
//    }
//
//    return;
//}
ll arr[2005];

int main()
{
    ll x,y,a,b,n,m,e,t,total=1;

    scanf("%lld",&n);
    for(ll i=1;i<=n;i++)
    {
        scanf("%lld",&arr[i]);
    }
    for(ll i=1;i<=n;i++)
    {
        ll count=1,curr=arr[i];
        while(curr!=-1)
        {
            curr=arr[curr];
            count++;
        }
        total=max(count,total);
    }
    cout << total << endl;
    return 0;
}