#AT7. Longest Path

Longest Path

Original Problem Statement (English)

Source: AtCoder Educational DP Contest - Problem G

Problem Statement

There is a directed graph GG with NN vertices and MM edges. The vertices are numbered 1,2,…,N1, 2, \ldots, N, and for each ii (1≤i≤M1 \leq i \leq M), the ii-th directed edge goes from Vertex xix_i to yiy_i. GG does not contain directed cycles.

Find the length of the longest directed path in GG. Here, the length of a directed path is the number of edges in it.

Constraints

  • All values in input are integers.
  • 2≤N≤1052 \leq N \leq 10^5
  • 1≤M≤1051 \leq M \leq 10^5
  • 1≤xi,yi≤N1 \leq x_i, y_i \leq N
  • All pairs (xi,yi)(x_i, y_i) are distinct.
  • GG does not contain directed cycles.

Input

Input is given from Standard Input in the following format:

N M
x_1 y_1
x_2 y_2
:
x_M y_M

Output

Print the length of the longest directed path in GG.

Sample Input 1

4 5
1 2
1 3
3 2
2 4
3 4

Sample Output 1

3

The red directed path in the following figure is the longest:

Sample Input 2

6 3
2 3
4 5
5 6

Sample Output 2

2

The red directed path in the following figure is the longest:

Sample Input 3

5 8
5 3
2 3
2 4
5 2
5 1
1 4
4 3
1 3

Sample Output 3

3

The red directed path in the following figure is one of the longest: