A - Party CodeForces - 115A（并查集另类运用？）

最新推荐文章于 2020-07-11 11:33:42 发布

云乐QAQ

最新推荐文章于 2020-07-11 11:33:42 发布

阅读量346

点赞数

本文链接：https://blog.csdn.net/qq_41658124/article/details/80599828

版权

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 p_i (1 ≤ p_i ≤ n or p_i = -1). Every p_i denotes the immediate manager for the i-th employee. If p_i 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 (p_i ≠ 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

Output

Note

For the first example, three groups are sufficient, for example:

Employee 1
Employees 2 and 4
Employees 3 and 5

题意！就是第i个的上司是pi 然后分组，上级和下属不能一组，求最小组；

那么只需求人最多的组数就好啦，之前想到去模拟把不是一个上下级关系的放一起，等级别的讨论啥的，复杂还想不明白；

代码：

#include"iostream"
#include"algorithm"
#include"cstring"
#include"set"
#include"vector"
using namespace std;
int pre[2005];
void init()
{
	for(int i = 0;i <  2001;i ++)
	{
		pre[i]=i;
	}
}
int find_step(int x)
{
	int sum = 0;
	int r=x;
	while(pre[r] != r)
	{
		r=pre[r];
		sum ++;
	}
	return sum;
}
int main()
{
	int n;
	while(cin >> n)
	{
		init();
		for(int i = 1;i <= n;i ++)
		{
			int x;
			cin >> x;
			if(x != -1)
			{
				pre[i]=x;
			}
		}
		int sum = 0;
		for(int i = 1;i <= n;i ++)
		{
			sum=max(sum,find_step(i));
		//	cout<<"I="<<i<<" findi"<<find_step(i)<<endl; 
		}
		cout<< sum+1<<endl;
	}
	return 0;
}