How to solve this Problem in O(N) or O(N * logN) or anything better than O(N^2).

Правка en1, от shekabhi1208, 2021-12-10 20:22:13

Hello codeforces, I want to know whether there is any solution to this problem that is better than the naive O(N ^ 2) or not?

Link to the Problem

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский shekabhi1208 2021-12-10 20:32:07 521 Tiny change: 'le Input\n2\n5 6\n' -> 'le Input\n\n2\n5 6\n'
en1 Английский shekabhi1208 2021-12-10 20:22:13 375 Initial revision (published)