How to prove this ?

Правка en1, от tanishq2507, 2023-11-12 16:38:35

https://mirror.codeforces.com/gym/104536/problem/F

The answer to this is max(d1,d2,ceil(d1/2)+ceil(d2/2)+1) where d1,d2 are diameters of the two trees.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский tanishq2507 2023-11-12 16:38:35 166 Initial revision (published)