CodeForces 115A Party（并查集）

A. Party

A company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee A is said to be the superior of another employee B if at least one of the following is true:

• Employee A is the immediate manager of employee B
• Employee B has an immediate manager employee C such that employee A is the superior of employee C.

The company will not have a managerial cycle. That is, there will not exist an employee who is the superior of his/her own immediate manager.

Today the company is going to arrange a party. This involves dividing all n employees into several groups: every employee must belong to exactly one group. Furthermore, within any single group, there must not be two employees A and B such that A is the superior of B.

What is the minimum number of groups that must be formed?

Input

The first line contains integer n (1 ≤ n ≤ 2000) — the number of employees.

The next n lines contain the integers pi (1 ≤ pi ≤ n or pi = -1). Every pi denotes the immediate manager for the i-th employee. If pi is -1, that means that the i-th employee does not have an immediate manager.

It is guaranteed, that no employee will be the immediate manager of him/herself (pi ≠ i). Also, there will be no managerial cycles.

Output

Print a single integer denoting the minimum number of groups that will be formed in the party.

Examples

input

5
-1
1
2
1
-1

output

3

题目大意：给出每个员工的直属上级，-1说明没有直属上级。如果A是B的上级，B是C的上级，那么A也是C的上级。现在公司里有N个人要开party，要求上级和下属不能坐在同一张桌子上，问至少需要几张桌子。

解题思路：并查集，不要路径压缩，因为要记录深度。输出最大深度即可。

代码如下：

#include <bits/stdc++.h>
#define MEM(arr,val) memset(arr,val,sizeof(arr))
#define INF INT_MAX / 10
const int maxn = 2010;
int par[maxn];

int find(int x)
{
    int dep = 0;
    while(par[x] != x){
        x = par[x];
        dep++;
    }
    return dep;
}

int main()
{
    int n,p;
    scanf("%d",&n);
    for(int i = 1;i <= n;i++){
        scanf("%d",&p);
        if(p == -1)
            par[i] = i;
        else
            par[i] = p;
    }
    int ans = 0;
    for(int i = 1;i <= n;i++){
        ans = std::max(ans,find(i));
    }
    printf("\n%d\n",ans + 1);
    return 0;
}