POJ 3280 Cheapest Palindrome DP

最新推荐文章于 2022-04-02 11:13:45 发布

原创最新推荐文章于 2022-04-02 11:13:45 发布 · 600 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

动态规划专栏收录该内容

55 篇文章

订阅专栏

题意：给定一个字符串，将它调整成回文串。可以在它上面添加或者删除任意一个字符，但是每增加或者删除一个字符都有一个代价，求代价最小的方案。
题解：添加和删除的操作其实一样，所以只要求出添加和删除的较小值，作为对该字符进行操作的代价。


#include <iostream>
using namespace std;

int dp[2001][2001], cost[30];
char s[2005];

int min ( int a, int b )
{
	return a < b ? a : b;
}

int main()
{
	char ch;
	int n, m, add, del, i, j;
	//freopen("a.txt","r",stdin);
	scanf("%d %d",&n,&m);
	scanf("%s",s+1);
	for ( i = 1; i <= n; i++ )
	{
		getchar();
		scanf("%c%d%d",&ch,&add,&del);
		cost[ch-'a'] = min ( add, del );
	}

	for ( i = m - 1; i >= 1; i-- )
	{
		for ( j = i + 1; j <= m; j++ )
		{
			if ( s[i] == s[j] )
				dp[i][j] = dp[i+1][j-1];
			else
				dp[i][j] =  min ( dp[i+1][j] + cost[s[i]-'a'], dp[i][j-1] + cost[s[j]-'a'] );	
		}
	}
	printf("%d\n", dp[1][m] );
	return 0;
}

方法二：

#include <iostream>
using namespace std;

int dp[2001][2001], cost[30];
char s1[2005], s2[2005];

int min ( int a, int b )
{
	return a < b ? a : b;
}

int main()
{
	char ch;
	int n, m, add, del, i, j;
	scanf("%d %d",&n,&m);
	scanf("%s",s1+1);
	for ( i = 1; i <= n; i++ )
	{
		getchar();
		scanf("%c%d%d",&ch,&add,&del);
		cost[ch-'a'] = min ( add, del );
	}

	i = 1; j = m;
	while ( i <= m && j >= 1 )
	{
		s2[i] = s1[j];
		i++; j--;
	}

	dp[0][0] = 0;
	for ( i = 1; i <= m; i++ )
	{
		dp[i][0] = dp[i-1][0] + cost[s1[i]-'a'];
		dp[0][i] = dp[0][i-1] + cost[s2[i]-'a'];
	}

	for ( i = 1; i <= m; i++ )
	{
		for ( j = 1; j <= m; j++ )
		{
			if ( s1[i] == s2[j] )
				dp[i][j] = dp[i-1][j-1];
			else
				dp[i][j] =  min ( dp[i-1][j] + cost[s1[i]-'a'], dp[i][j-1] + cost[s2[j]-'a'] );	
		}
	}
	printf("%d\n", dp[m][m] / 2 );
	return 0;
}