题目
给定一个字符串(len<=60),求回文子序列数量
解题思路
区间DP,dp[i][j]表示区间[i,n]的回文子序列数量。
初始化
memset(dp, 0, sizeof dp);
for (int i = 1; i <= n; i++)
dp[i][i] = 1;
for (int i = 1; i < n; i++)
dp[i][i + 1] = (s[i] == s[i + 1] ? 3 : 2);
状态转移:
如果
s
[
l
]
=
=
s
[
r
]
s[l]==s[r]
s[l]==s[r],
d
p
[
l
]
[
r
]
=
d
p
[
l
+
1
]
[
r
]
+
d
p
[
l
]
[
r
−
1
]
−
d
p
[
l
+
1
]
[
r
−
1
]
+
d
p
[
l
+
1
]
[
r
−
1
]
+
1
dp[l][r]=dp[l+1][r]+dp[l][r-1]-dp[l+1][r-1]+dp[l+1][r-1]+1
dp[l][r]=dp[l+1][r]+dp[l][r−1]−dp[l+1][r−1]+dp[l+1][r−1]+1;
理解:对于区间 [ l , r ] [l,r] [l,r],小于这个区间的回文子序列依然存在,也就是 d p [ l + 1 ] [ r ] + d p [ l ] [ r − 1 ] − d p [ l + 1 ] [ r − 1 ] dp[l+1][r]+dp[l][r-1]-dp[l+1][r-1] dp[l+1][r]+dp[l][r−1]−dp[l+1][r−1],另外,区间 [ l + 1 , r − 1 ] [l+1,r-1] [l+1,r−1]里边的所有回文子序列,在两边同时加上 s [ l ] / s [ r ] s[l]/s[r] s[l]/s[r],会产生新的 d p [ l + 1 ] [ r − 1 ] dp[l+1][r-1] dp[l+1][r−1]个回文子序列,最后还需要算上 s [ l ] s [ r ] s[l]s[r] s[l]s[r]这两个字符组成的回文子序列。
如果 s [ l ] ! = s [ r ] s[l]!=s[r] s[l]!=s[r], d p [ l ] [ r ] = d p [ l + 1 ] [ r ] + d p [ l ] [ r − 1 ] − d p [ l + 1 ] [ r − 1 ] dp[l][r]=dp[l+1][r]+dp[l][r-1]-dp[l+1][r-1] dp[l][r]=dp[l+1][r]+dp[l][r−1]−dp[l+1][r−1];
显然,不会有新增的贡献。
代码
#include <bits/stdc++.h>
using namespace std;
long long dp[65][65]; //dp[i][j]表示区间[i,j]的最大贡献
char s[1010];
void solve()
{
scanf("%s", s + 1);
int n = strlen(s + 1);
memset(dp, 0, sizeof dp);
for (int i = 1; i <= n; i++)
dp[i][i] = 1;
for (int i = 1; i < n; i++)
dp[i][i + 1] = (s[i] == s[i + 1] ? 3 : 2);
for (int len = 3; len <= n; len++)
{
for (int l = 1; l + len - 1 <= n; l++)
{
int r = l + len - 1;
if (s[l] == s[r])
dp[l][r] = dp[l + 1][r] + dp[l][r - 1] - dp[l + 1][r - 1] + dp[l + 1][r - 1] + 1;
else
dp[l][r] = dp[l + 1][r] + dp[l][r - 1] - dp[l + 1][r - 1];
}
}
cout << dp[1][n] << endl;
}
int main()
{
int t;
cin >> t;
while (t--)
solve();
return 0;
}