VM7WC '16 #5 Gold - Jayden Studies Trees

View as PDF

Submit solution

Points: 7
Time limit: 0.6s
Memory limit: 64M

Author:
Problem types

Jayden is a little kid that likes to study trees. From the last problem, Jayden has cut down many trees. Each tree is an undirected graph where any two nodes are connected by exactly one path. Jayden would like to find the length of the longest of the paths. That means that he wants you to do it for him.

Input Specification

The first line will have N (1 \le N \le 10^4). The next N-1 lines will each contain two integers x and y (1 \le x,y \le N), denoting that an edge connects node x with node y.

Output Specification

On a single line, print the longest path between any two nodes in the tree.

Sample Input

6
1 2
1 3
2 4
2 5
5 6

Sample Output

4

Reaching the recursion limit on Python?

You can increase the amount of calls a recursive program in Python with the following code:

import sys
sys.setrecursionlimit(x)

x will be the maximum number of calls that a recursive function can call. If you set x to be too big, Python might run out of memory when performing the recursive calls and generate a Segmentation Fault. Try to keep x as low as possible.


Comments


  • 1
    YouZ  commented on Feb. 7, 2016, 9:31 p.m.

    So when it says it connects node x to node y that path goes both ways right?


    • 1
      Zander  commented on Feb. 8, 2016, 2:24 p.m.

      yup


  • 2
    d  commented on Feb. 5, 2016, 3:45 p.m.

    Is the output 4 because there is a path of length 4?

    3\implies1\implies2\implies5\implies6


    • -2
      cheesecake  commented on Feb. 5, 2016, 3:56 p.m.

      You're right, it has been fixed.