刷题记录（NC13230 合并回文子串）（待补充）

NC13230 合并回文子串

题目链接

关键点：

1、状态转移方程：dp[i][j][k][l],指s1的i-j和s2的k-l组成的字符串能否为一个回文序列

2、首先判断s1选定的序列是否为一个回文字串

if (s1[i-1] == s1[j-1] && d1>1)
dp[i][j][k][l] |= dp[i+1][j-1][k][l];

判断s2选定的序列是否为一个回文字串

 if (s2[l-1] == s2[k-1] && d2>1)
dp[i][j][k][l] |= dp[i][j][k+1][l-1];

s1的开头和s2的结尾能否组成一个回文字串

if (s1[i-1] == s2[l-1])
dp[i][j][k][l] |= dp[i+1][j][k][l-1];

s1的结尾和s2的开头能否形成一个回文字串

if (s1[j-1] == s2[k-1])
dp[i][j][k][l] |= dp[i][j-1][k+1][l];

完整代码：

# include <bits/stdc++.h>
using namespace std;
const int N = 55;
int dp[N][N][N][N];
int t, maxx;
string s1, s2;
int main()
{
    cin>>t;
    while (t--)
    {
        cin>>s1>>s2;
        maxx = 0;
        memset(dp, 0, sizeof(dp));
        for (int d1=0; d1<=s1.size(); d1++)
        {
            for (int d2=0; d2<=s2.size(); d2++)
            {
                for (int i=1, j=d1; j<=s1.size(); j++, i++)
                {
                    for (int k=1, l=d2; l<=s2.size(); l++, k++)
                    {
                        if (d1+d2<=1) dp[i][j][k][l] = 1;
                        else
                        {
                            if (s1[i-1] == s1[j-1] && d1>1)
                                dp[i][j][k][l] |= dp[i+1][j-1][k][l];
                            if (s2[l-1] == s2[k-1] && d2>1)
                                dp[i][j][k][l] |= dp[i][j][k+1][l-1];
                            if (d1&&d2)
                            {
                                if (s1[i-1] == s2[l-1])
                                    dp[i][j][k][l] |= dp[i+1][j][k][l-1];
                                if (s1[j-1] == s2[k-1])
                                    dp[i][j][k][l] |= dp[i][j-1][k+1][l];
                            }
                        }
                        if (dp[i][j][k][l]) maxx = max(d1+d2, maxx);
                    }
                }
            }
        }
        cout<<maxx<<endl;
    }
    return 0;
}