UVA 10739 [classical dp]

Method : We use dp[i][j] (i <= j) to represent the minimum operations needed to convert the section(i,j) in to a palindrome.  

If str[i] == str[j] , dp[i][j] = dp[i+1][j-1]. Or if str[i]!= str[j], dp[i][j] = min (dp[i+1][j],dp[i][j-1],dp[i+1][j-1]) + 1;

dp[i+1][j] ----> delete operation,

dp[i][j-1] ----> add operation

dp[i+1][j-1] ----> replace operation;

CODE:

#include<iostream>
#include<stdlib.h>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>
#include<algorithm>
#include <cstdio>
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))

using namespace std;
int dp[1005][1005];
int MIN_3(int a, int b, int c)
{
	int temp = MIN(a, b);
	temp = MIN(temp, c);
	return temp;
}
int solve(char c[])
{
	int len = strlen(c);
	memset(dp,0, sizeof(dp));

	for (int i = len - 1; i >= 0; i--)
		for (int j = i+1; j <= len-1; j++)
		{
			if (c[i] == c[j])
				dp[i][j] = dp[i + 1][j - 1];
			else dp[i][j] = MIN_3(dp[i + 1][j], dp[i][j - 1], dp[i + 1][j - 1]) + 1;
		}

	return dp[0][len - 1];
}
int main()
{
//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);

	int t;
	cin >> t;
	char str[1005];

	for (int i = 1; i <= t;i++)
	{
		cin >> str;
		
		int ans = solve(str);

		printf("Case %d: %d\n", i, ans);

	}
	return 0;
}