CodeForces - 115A Party 森林 搜索bfs

Training 5 - D题

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

Note

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

Employee 1
Employees 2 and 4
Employees 3 and 5

#pragma warning (disable:4996)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define inf 0X3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e7 + 5;
const int maxn = 2e3 + 5;

int head[maxn], ver[maxn], nex[maxn];
int d[maxn];//深度
bool r[maxn];
int tot;

int ans = 0;

void add(int x, int y)
{
	tot++;
	ver[tot] = y;
	nex[tot] = head[x];
	head[x] = tot;
}

void bfs(int root)
{
	memset(d, 0, sizeof(d));
	queue<int> q;
	q.push(root);
	d[root] = 1;
	ans = max(ans, d[root]);
	while (q.size())
	{
		int x = q.front();
		q.pop();
		for (int i = head[x]; i; i = nex[i])
		{
			int y = ver[i];
			if (d[y])
				continue;
			d[y] = d[x] + 1;
			ans = max(ans, d[y]);
			q.push(y);
		}
	}
}

int main()
{
	int n;
	scanf("%d", &n);
	memset(r, 1, sizeof(r));
	for (int i = 1; i <= n; i++)
	{
		int p;
		scanf("%d", &p);
		if (p == -1)
			continue;
		add(p, i);
		r[i] = 0;
	}
	for (int i = 1; i <= n; i++)
		if (r[i] == 1)
			bfs(i);
	printf("%d\n", ans);
	return 0;
}

思路：
bfs遍历，记录最深的深度。