-
Notifications
You must be signed in to change notification settings - Fork 0
/
115A - Party.cpp
66 lines (60 loc) · 1.09 KB
/
115A - Party.cpp
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
66
#include<iostream>
#include<cmath>
#include<cstring>
#include<set>
#include<vector>
#include<map>
#include<algorithm>
#include<sstream>
#include<climits>
#include<utility>
#define MX 100000
#define fs first
#define sec second
#define vi vector<int>
#define pi pair<int, int>
#define TC int T;cin>>T;while(T--)
#define loop(i,a) for(int i=0;i<a;i++)
#define loop1(i,a,c) for(int i=1;i<=a;i++)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define mp(x, y) make_pair((x), (y))
#define ll long long int
#define iter(c) typeof(c.begin())
#define foreach(it, c) for(iter(c) it = c.begin(); it != c.end(); it++)
using namespace std;
bool visited[2001];
vector<int>v[2001];
int c=1;
int d[2001];
void dfs(int x,int d)
{
c = max(c,d);
for(int i = 0; i < v[x].size(); i++)
{
dfs( v[x][i] ,d+1);
}
}
int main()
{
int t;
memset(visited,false,sizeof visited);
for(int i=0;i<2000;i++)d[i]=1;
cin>>t;
for(int i=0;i<2001;i++)
{
v[i].clear();
}
for(int i=1;i<=t;i++)
{
int x;
cin>>x;
if(x==-1)continue;
v[x].push_back(i);
}
for(int i=1;i<=t;i++)
{
dfs(i,1);
}
cout<<c;
}