PT07Z - Longest path in a tree

You are given an unweighted, undirected tree. Write a program to output the length of the longest path (from one node to another) in that tree. The length of a path in this case is number of edges we traverse from source to destination.

Input

The first line of the input file contains one integer N --- number of nodes in the tree (0 < N <= 10000). Next N-1 lines contain N-1 edges of that tree --- Each line contains a pair (u, v) means there is an edge between node u and node v (1 <= u, v <= N).

Output

Print the length of the longest path on one line.

Example

Input:
3
1 2
2 3

Output:
2

Added by:Thanh-Vy Hua
Date:2007-03-28
Time limit:0.5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Co-author Amber

hide comments
2019-01-16 20:56:14
AC in one go
Nice question --> recursion , must for beginners
2018-12-11 21:49:28
The solution from @ktcoder is the easiest and easier to generalize to harder problems.
2018-11-29 12:00:59
don't say the solution here!
:(
2018-09-21 20:07:56
Very simple solved using bfs twice 0.01s
2018-09-02 22:10:56
AC in one go , very simple apply 2 BFS.
2018-08-15 18:07:56
@suvro_coder it is because n = 6, hence edges should be 5 but you provided 6 edges. Put n = 7 and you will get your answer.
2018-08-04 10:37:08
For Java use BufferedReader for I/O rather than Scanner.
2018-07-20 11:00:53
Weak Test Cases:
6
1 2
2 3
3 4
2 5
2 6
6 7

In this test case output should be 4, (4-3-2-6-7) but my accepted solution gives output 3.
Done in 1 dfs.
2018-07-19 17:44:37
Try CLCKBAIT after this!
2018-07-06 05:52:41
those who are doing it by finding it longest and second longest .! how are you guys are substracting extra value that you have counted ! (considering your dfs does not start from any root)!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.