What I did was of course order 3 but it got AC in 0.062sec and 1133 kb memory. I wonder why n^3 would need .8 sec or TLE. I may do it in n^2 but please tell me about the infamous O(n) algo.