Assistance for 689D

Правка en1, от miniluigi, 2016-07-08 04:38:49

I have tried to use the Sparse Table Algorithm in order to compute the RMQ in this problem. However, there must be some error in either the algorithm or the binary search as seem to be overcounting the number of ordered pairs. If anyone can find the error, I would greatly appreciate your assistance. Thanks!

Here is my submission: http://mirror.codeforces.com/contest/689/submission/18959583

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский miniluigi 2016-07-08 05:07:37 217
en1 Английский miniluigi 2016-07-08 04:38:49 407 Initial revision (published)