Help for problem Pair of numbers 290 div2 D

Revision en1, by fullbuster, 2017-06-05 14:11:08

Problem link http://codeforces.net/problemset/problem/359/D

Here is my solution for the problem http://codeforces.net/contest/359/submission/27581236 I first created lefty[i] and righty[i] which contains the left and right index of the farthest number such that all numbers between farthest number and number at index i are divisible by a[i] . I created it using sparse table . My solution is failing at testcase 25 can someone please help me to debug it.

Tags sparse table, round 209

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English fullbuster 2017-06-05 14:11:08 505 Initial revision (published)