Graph Theory Task

Правка ru6, от DmitryGrigorev, 2017-06-06 01:31:04

Can anybody help me with this task: We have a tree with N verteces(N<=5*10^5). Each edge has got a length Li(Li<=1000). In each iteration we delete one(given) of un-deleted edges and we must tell the longest simple way in each of two resulting components and we doing it while all edges aren't deleted. Please, any ideas how to solve it?

Теги графы, дерево

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
ru6 Русский DmitryGrigorev 2017-06-06 01:31:04 47
en3 Английский DmitryGrigorev 2017-06-06 01:30:37 59
ru5 Русский DmitryGrigorev 2017-06-06 01:28:34 2 Мелкая правка: 'elete one(_given_) of un-de' -> 'elete one(given) of un-de'
ru4 Русский DmitryGrigorev 2017-06-06 01:28:01 9 Мелкая правка: 'delete one of un-del' -> 'delete one(_given_) of un-del'
ru3 Русский DmitryGrigorev 2017-06-06 01:25:59 24
en2 Английский DmitryGrigorev 2017-06-06 01:23:19 19
en1 Английский DmitryGrigorev 2017-06-06 01:19:22 294 Initial revision for English translation
ru2 Русский DmitryGrigorev 2017-06-06 01:16:26 10 Мелкая правка: 'has got a weight Wi(Wi<=1000). ' -> 'has got a length Li(Li<=1000). '
ru1 Русский DmitryGrigorev 2017-06-06 01:15:42 294 Первая редакция (опубликовано)