I am trying to solve http://mirror.codeforces.com/problemset/problem/551/B but when I submit the solution I get wrong answer...so to check again I went to ideone and checked the output for that test case and I get correct answer any suggestions?

Link to codeforces solution http://mirror.codeforces.com/contest/551/submission/11634884

Link to ideone solution http://ideone.com/3xgM8v

I am solving this problem in O(m*n) but still TLE link to problem http://www.codechef.com/problems/PD12 Link to solution http://www.codechef.com/viewsolution/6514367

I am trying to solve http://mirror.codeforces.com/contest/514/problem/C but repeatedly getting wa at test 6.Tried a lot but can't figure out the problem...Link to my solution http://mirror.codeforces.com/contest/514/submission/9883601

Hello friends I am trying to solve http://www.spoj.com/problems/GSS1/ but I am a little weak in segment trees So I am not able to figure out How my preprocessing function will look like and also If someone could explain a way to solve this without segment trees (as there are only queries no updation required)