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 N1 lines contain N1 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
hide comments
Sukeesh:
20150621 20:32:12
BFS + BFS ! .. AC in one go .. :) 

Ankush :
20150619 12:36:31
BFS + BFS :D 

BALMUKUND SINHA:
20150615 16:21:01
getting tle


Anant Kumar:
20150612 19:43:18
this is a good problem 

Mitch Schwartz:
20150408 01:51:00
That's not true either. I think what you mean to say is that it implies that if the test data is not wrong, then it is incomplete. (This is ignoring the possibility of a faulty judge, for simplicity.)


reggaeguitar:
20150407 22:51:13
Although it doesn't imply that the test data is wrong, it does imply that it is incomplete 

Mitch Schwartz:
20140820 08:57:07
@Raj Kamal: Getting AC with wrong code does not imply test data is wrong. (Let W = set of cases for which your code produces wrong answer, and let I = set of cases in the actual input. It could be that the intersection of I and W is empty.)


Raj Kamal:
20140819 22:23:29
The test cases are all wrong. As many have already mentioned, I also got AC for the cases mentioned by Pankaj Saini and others, when my solution was actually clearly wrong,

Added by:  ThanhVy Hua 
Date:  20070328 
Time limit:  0.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Coauthor Amber 