UVa 10739 - String to Palindrome

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
const int INF = 1 << 30;

using namespace std;

int len, dp[1005][1005], Case, cnt;
string str;

int Dp ( int i, int j ) {
int &ans = dp[i][j];
if ( ans != INF ) return ans;
ans = 1;
if ( j == i + 1 ) {
if ( str[i] == str[j] ) return ans = 0;
else return ans = 1;
}
if ( str[i] == str[j] ) ans = Dp ( i + 1, j - 1 );
else ans = min ( Dp ( i + 1, j ), min ( Dp ( i, j - 1 ), Dp ( i + 1, j - 1 ) ) ) + 1;
return ans;
}
int main ( ) {
cin >> Case;
for ( cnt = 1; cnt <= Case; ++cnt ) {
cin >> str;

len = str.length ( );
for ( int i = 0; i < 1005; ++i ) {
for ( int j = 0; j < 1005; ++j ) {
dp[i][j] = INF;
}
dp[i][i] = 0;
}
cout << "Case " << cnt << ": " << Dp ( 0, len - 1 ) << endl;

}
}