|| ||Code Submission Evaluation System
CSES Problem Set
Task | Statistics
CSES - Tree DistancesCSES - Tree Distances
|Time limit:||1.00 s
||Memory limit:||512 MB|
You are given a tree that consists of $n$ nodes.
Your task is to determine for each node the maximum distance to another node.
The first input line contains an integer $n$: the number of nodes. The nodes are numbered $1,2,\ldots,n$.
Then there are $n-1$ lines that describe the edges. Each line contains two integers $a$ and $b$: there is an edge between nodes $a$ and $b$.
Print $n$ integers: for each node $1,2,\ldots,n$, the maximum distance to another node.
- $1 \le n \le 5 \cdot 10^5$
- $1 \le a,b \le n$
2 3 2 3 3