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
|
marcus_996:
2022-10-05 15:08:28
nice problem! |
|
the1uknow_who:
2022-04-24 16:52:06
nice problem :) |
|
elsayedzahran:
2022-04-16 01:51:21
what does this mean Runtime error (SIGSEGV)
|
|
srivathsav1410:
2022-03-15 15:00:15
both depth and diameter conepts will be cleared with this problem
|
|
avx_5801:
2021-07-14 10:41:58
AC in One Go ...by using just 2 dfs call one call for finding farthest node and other for finding longest distances using farthest node :) |
|
darkdeveloper:
2021-07-07 20:03:48
The question is highly misleading i tried a lot of times the actual number of nodes is greater than 10000. I took an array of 1e6 for the solution to finally get accepted. If your code fails at test(5) take the size of array to be 1e6 (1000000) |
|
loser_404:
2021-06-04 08:15:42
useful lecture https://www.youtube.com/watch?v=JahlIiTzZWQ&t=947s&ab_channel=HiteshTripathiHiteshTripathi |
|
adi123cm:
2021-06-02 03:49:54
use double dfs |
|
|
adi123cm:
2021-06-02 03:49:29
good question helped clear my concepts. |
|
lolkey:
2021-04-20 18:04:44
AC in one GO :)
|
| 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 |
RSS