i have submitted the solution to problem LITE on SPOJ. it accepted.but to the similar problem on codechef FLIPPING COIN problem it gives me SIGSEGV runtime error.I can’t point out the problem.even i have increases the size of array to 100000*5 to not go out of bound but it seems no improvement.does the larger size matters i.e. 1000000 of an array to cause SIGSEGV error???
@saikrishna173 dude solution to this problem are not visible to public, no one can see your solution
@argonaut Hmm… Still u can try to solve it after reading about segment trees in that link.
anyne help please