Help for a 1600 problem with no editorial

Правка en1, от sister_of_contestfucker, 2020-02-11 04:35:12

I'm trying to solve this problem Link but the best approach I can come up with is (max(n,m))^3*logn . An efficient solution will be appreciated thanks.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский sister_of_contestfucker 2020-02-11 04:35:12 241 Initial revision (published)