「牛客dp专题1」合并回文子串(字符串区间dp)

date:2022/1/12
URL:https://ac.nowcoder.com/acm/contest/24213/1026

前置知识

DP求解最长回文子串
思路为枚举字符串长度和子串初位置
时间复杂度 O($n^2$)
状态转移方程：

初始化边界为 $dp[i][i]=1,dp[i][i+1]=(S[i]==S[i+1])?1:0$

  forn(i,len){
        f[i][i] = 1;
        if(i < len - 1 && s[i] == s[i+1]) {
            f[i][i+1] = 1,ans = 2,res = s.substr(i,2);
        }  
    }
    forr(i,3,len){
        for(int j = 0; i + j - 1 <= len;j++){
            int v = i+j-1;
            if(s[j] == s[v] && f[j+1][v-1]){
                f[j][v] = 1;
                ans = i;
                res = s.substr(j,i);
            }
        }
    }

题目大意

输入两个字符串A和B，合并成一个串C，属于A和B的字符在C中顺序保持不变
需要求出所有可能的C中价值最大的字符串，输出这个最大价值即可

思路

基本思路同求解单字符串的最大回文子串
考虑到 $f[i][j][p][q]：A[i....j]与B[p...q]能否合并成回文串$
状态转移方程：

if(A[i]==A[j])  dp[i][j][p][q] |=dp[i+1][j-1][p][q];
if(A[i]==B[q])  dp[i][j][p][q] |=dp[i+1][j][p][q-1];
if(B[p]==B[q])  dp[i][j][p][q] |=dp[i][j][p+1][q-1];
if(B[p]==A[j])  dp[i][j][p][q] |=dp[i][j-1][p+1][q];

Code

/*
    author:@bzdhxs
    date:2022/1/12
    URL:https://ac.nowcoder.com/acm/contest/24213/1026
    合并回文子串;
    运行时间: 673ms
    占用内存: 7600KB
*/
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<queue>
using namespace std;
template <typename T>
inline void read(T &s){s = 0;T w = 1, ch = getchar();while (!isdigit(ch)) { if (ch == '-') w = -1; ch = getchar(); }while (isdigit(ch))  { s = (s << 1) + (s << 3) + (ch ^48); ch = getchar();} s *= w;}
template <typename T>
inline void write(T s){if (s < 0) putchar('-'), s = -s;if (s > 9) write(s / 10);putchar(s % 10 + '0');}
#define int long long
#define _orz ios::sync_with_stdio(false),cin.tie(0)
#define mem(str,num) memset(str,num,sizeof(str))
#define forr(i,a,b) for(int i = a; i <= b;i++)
#define forn(i,n) for(int i = 0; i < n; i++)
#define dbg() cout <<"0k!"<< endl;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int N = 1e6+10;


signed main()
{
    int t; cin >> t;
    while(t--){
        _orz;
        bool f[52][52][52][52] = {0}; // 开bool数组更快
        string a,b;
        cin >> a >> b;
        int l1 = a.size(), l2 = b.size();
        a = " " + a;
        b = " " + b;
        int res = 0;
        forr(i,0,l1)//从0开始枚举A的长度
        forr(j,0,l2)//同上
        for(int u = 1;u + i -1 <= l1;u++){//A的起始点
            int v = u+i-1;// A的终点
            for(int p = 1;p+j-1 <= l2;p++){// B的起始点
                int q = p+j-1;//B的终点
                bool &t = f[u][v][p][q];
                if(i+j <= 1) t = 1; // A和B的长度和小于等于1，一定可以组成回文串
                else{
                    if(i && a[u] == a[v])   t |= f[u+1][v-1][p][q];
                    if(i && j && a[u] == b[q]) t |= f[u+1][v][p][q-1];
                    if(i && j && a[v] == b[p]) t |= f[u][v-1][p+1][q];
                    if(j && b[p]== b[q]) t |= f[u][v][p+1][q-1];
                }
                if(t) res = max(res,i+j);
            }
        }
        cout << res << '\n';
    }
    return 0;
}