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
hide comments
psionic:
2015-07-12 23:55:11
DFS and DFS :D |
|
Ankur Arora:
2015-07-12 21:57:35
kindly
|
|
santamaria:
2015-07-03 17:20:14
Ohh yeah (BFS & BFS) :D |
|
Deeksha:
2015-06-29 12:25:03
take 1 as start node.. Last edit: 2015-06-29 20:39:20 |
|
karan:
2015-06-25 10:13:11
(BFS&BFS) :D Last edit: 2015-06-25 10:13:34 |
|
Sukeesh:
2015-06-21 20:32:12
BFS + BFS ! .. AC in one go .. :) |
|
Ankush :
2015-06-19 12:36:31
BFS + BFS :D |
|
BALMUKUND SINHA:
2015-06-15 16:21:01
getting tle
|
|
Anant Kumar:
2015-06-12 19:43:18
this is a good problem |
|
Mitch Schwartz:
2015-04-08 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.)
|
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 |