[SPOJ] O(n^2) test case for PALDR's simple algorithm

Thanks to misof, there's a counterexample to show that the simple algorithm for PALDR is still O(n^2):

(abcd)^n xy (dcba)^n

Problem is rejudged. Some previously AC solutions got TLEs.