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
kunal todi:
2016-06-25 11:56:21
Can anyone help me.I got TLE..it runs till 5th test case... |
|
pratika:
2016-06-24 11:57:17
WA repeatedly, removed memset and got ac :O |
|
baadshah_:
2016-06-22 21:11:56
Finally AC ! did it using single DFS!!dont use matrix !!USE adj List Last edit: 2016-06-22 21:13:15 |
|
demigod_luffy:
2016-06-18 09:00:36
My 50th one!!! one dfs + dp :) |
|
sarvesh_19:
2016-06-16 21:44:07
famous graph problem (easy). N<=10000 array repn giving RTE and TLE...use adjacency list *only trick in this q*. |
|
praval_singhal:
2016-05-19 16:48:16
I submitted the same code 1 hr ago. got WA. Now AC. what the F :P |
|
Shreyans:
2016-04-13 12:46:58
Last edit: 2016-04-13 22:43:12 |
|
Ram:
2016-03-31 22:12:13
Finally got AC..!! Got WA repeatedly while using start node as 1. Changed the start node from 1 to last node and it got accepted. Please notify if there is anything wrong in my code.
|
|
sharif ullah:
2016-03-14 09:47:06
just find the diameter of a tree.2 bfs.needed!!!!!!!!!!!! |
|
rohit123456:
2016-03-05 12:28:44
done in a single dfs |
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 |