The Specials Menu - lightOJ 1025
题意
T组数据,每组数据给出一个字符串,问删去字符使其成为回文串的方案数
题解
1)s[i] != s[j]时,我们考虑dp[i][j]从dp[i+1][j]和dp[i][j-1]转移,删掉s[j],dp[i][j] += dp[i][j-1],删掉s[i],dp[i][j] += dp[i+1][j],但存在同时删除的情况,所以其中dp[i+1][j-1]为重复计算的部分,所以有dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1]。
2)s[i] == s[j]时,那么显然,对于从i+1到j-1的字符,我们删去后得到的回文串s',左右加上s[i]和s[j]仍为回文串。删掉i+1到j-1的所有字符后,剩下"s[i]s[j]"也为回文串,所以有dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1] + dp[i+1][j-1] + 1 = dp[i+1][j] + dp[i][j-1] + 1。
(这个是s[i]=s[j],时其实可以理解成把s[i+1]到s[j-1]全部删掉这一种方案+dp[i+1][j-1])这样会更好理解。
代码如下:
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100;
char s[maxn];
long long dp[maxn][maxn];
int main()
{
int t, ca = 1;
cin >> t;
while(t--)
{
memset(dp, 0, sizeof(dp));
cin >> s;
int n = strlen(s);
for(int i = 0; i < n; i++)
dp[i][i] = 1;
for(int len = 1; len < n; len++)
{
for(int i = 0; i+len < n; i++)
{
int j = i + len;
if(s[i] == s[j])
dp[i][j] = dp[i+1][j-1] + 1; // dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1] + (dp[i+1][j-1]+1);
else
dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1];
}
}
printf("Case %d: %lld\n", ca++, dp[0][n-1]);
}
return 0;
}