Обсуждение @ 1056. Центры сети @ Timus Online Judge

Huang Yizheng I have the O(n) algorithm,do you want to know? [3] // Задача 1056. Центры сети 2 ноя 2001 09:57

Timus Observer Re: I have the O(n) algorithm,do you want to know? [2] // Задача 1056. Центры сети 2 ноя 2001 14:20

YES, you are like salesman now.

Piratek-(akaDK) Re: I have the O(n) algorithm,do you want to know? [1] // Задача 1056. Центры сети 30 авг 2008 15:39

I think we can find answer_depth of roots for O(N) - let's consider d - diameter of tree, if d mod 2 = 0 then ans_depth = d div 2 else ans_depth = d div 2 + 1

Edited by author 30.08.2008 15:39

Edited by author 30.08.2008 15:40

tiancaihb Re: I have the O(n) algorithm,do you want to know? // Задача 1056. Центры сети 12 авг 2009 07:34

Everyone knows it's O(n)

Обсуждение задачи 1056. Центры сети