Problem link http://codeforces.me/problemset/problem/359/D
Here is my solution for the problem http://codeforces.me/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.
27584809 Be careful about constraints next time :)
(log(n) is equal to 18, hence your sparse table fails).
When j=19 i=0 we have 0+(1<<19)-1 = 524287 > n so how will this change make any difference.
Please correct me for what i am missing.
Oh got it!
You were talking about the memory allocation.
Thanx Man :)