Getting WA in SEATSR
my solution link is link:http://www.codechef.com/viewsolution/5146159
please provide corner cases
There are as such no corner cases for this problem apart from the case when cost of insertion and deletion is zero. Pretty simple algorithm based problem. I dint look into ur solution though. But i know it has no corner cases! U must be doing some very small mistake. This problem simply needs optimization. Algorithm is fairly simple.