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
2016-01-30 14:18:18 newbie
answer is 5
2016-01-30 14:17:44 newbie
simple dfs accepted in 0.00 s
a test case to check:
13
1 2
1 3
1 4
3 5
3 6
3 7
6 8
6 9
7 10
7 11
10 12
10 13
2016-01-15 06:29:00
Did it by using bfs twice, what is the dfs way of doing it ? If anyone could please provide some helpful link for solving it with dfs..
2015-12-26 00:12:43
Using a 2D matrix of type char to store edge information gives runtime error..But using adjacency list to store graph give AC....How can the 2D matrix possibly exceed memory available?? Costed me 2 RE. :(
2015-12-25 18:23:38 vedang
Don't know why but when I changed memset to fill_n in my C++ code, WA turned into AC!
2015-12-18 11:30:44
the tree should not have a cycle but the test cases have a cycle in them for example
7
1 2
2 3
4 5
5 6
6 7
5 7
2015-12-18 11:18:19
for the test case
7
1 2
2 3
4 5
5 6
6 7
5 7
this is not a tree because it has a cycle... then how its a valid question
2015-12-17 16:36:48
AC in 1 go :) Just be careful with ordering of tree.
2015-12-15 11:20:08
http://www.spoj.com/users/markroxor
ur example is not a connected graph
2015-12-13 11:59:00
Ooh, finally I am learnig graphs!!!
did with both dfs and bfs
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.