| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
I try it using a BFS. Starting in a node with degree 1, setting the node as visited and its neighbors, adding in the queue the neighbors of neighbors of node. But, i was received only wrong answer with this strategy :(
Link for the problem: http://www.spoj.com/problems/IMPER/
sorry for my bad english.
Your approach will lead to WA, consider the following test case:
10
1 2 3 4 2 6 7 8 9
-1
What is the right answer?
To solve this problem you need to learn what is and how to calculate the diameter of a tree. I won't link any tutorial, since I don't know about any particularly good, but googling it should be enough.
This is the code I got Accepted with: Don't click me
oow, thank you so much for advice.
After looking for the diameter of a tree, this problem look so easy xD
Thanks very much :D
I got Accepted in 2 OJ and there is one thing I can't understand:
Why does this case return 2 instead of 3?
7
1 2 1 4 1 6
Thanks!
Damn!
I was simulating the problem in a wrong way.
Thanks a lot!
One of the tags of this post is "need help" XD .