gym 100962 problem D Deep Purple

Правка en1, от Los_Angelos_Laycurse, 2016-04-18 10:23:28

sa +president_tree + brute_force Accepted this problem, seems it is O(n*poly(log(n)),but it needs some proof...,there is litte possibilaty it is O(n^2*poly(log(n))).

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Los_Angelos_Laycurse 2016-04-18 10:23:28 199 Initial revision (published)