题目大意:
输入两个括号序列 s,t(不一定合法),你需要构造一个尽可能短的合法括号序列使得s,t 都是这个序列的子序列(子序列意味着不用连续)
题解:首先答案至多不会超过400,(200对 “()” 一定满足要求)。设dp[i][j][v]
表示s串已匹配 前i个括号,t串 已经匹配前j个括号,此时构造的括号序列左括号比右括号多 v 个的构造序列的最小长度。
转移:枚举每一位放 (
还是放 )
,
放置 (
:若 s[i] == (
则 ni = i + 1
,同理 nj,dp[ni][ni][v + 1] = dp[i][j][v] + 1
;
放置 )
:若 s[i] == )
则 ni = i + 1
,同理 nj,dp[ni][ni][v - 1] = dp[i][j][v] + 1
;
要注意整个过程要保证 0 <= v <= 200
,不在这个范围内一定不是正解
要构造最后的答案,需要记录转移的父节点。dp可以用bfs实现,每一步决策只会最多产生两个新的节点,具体见代码;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e2 + 10;
const int inf = 0x3f3f3f3f;
char s[maxn],t[maxn];
int dp[maxn][maxn][maxn],n,m;
struct node{
int x,y,z;
char c;
node(int xi = 0,int yi = 0,int zi = 0,char ci = 0) {
x = xi;
y = yi;
z = zi;
c = ci;
}
}p[maxn][maxn][2 * maxn];
vector<char> g;
void bfs() {
memset(dp,inf,sizeof dp);
queue<node> q;
q.push(node(0,0,0));
dp[0][0][0] = 0;
while(!q.empty()) {
node top = q.front();
q.pop();
int nx = top.x + (top.x < n && s[top.x] == '(');
int ny = top.y + (top.y < m && t[top.y] == '(');
int nz = top.z + 1;
if(nz <= 200 && nz >= 0 && dp[nx][ny][nz] == inf) {
dp[nx][ny][nz] = dp[top.x][top.y][top.z] + 1;
p[nx][ny][nz] = node(top.x,top.y,top.z,'(');
q.push(node(nx,ny,nz));
}
nx = top.x + (top.x < n && s[top.x] == ')');
ny = top.y + (top.y < m && t[top.y] == ')');
nz = top.z - 1;
if(nz <= 200 && nz >= 0 && dp[nx][ny][nz] == inf) {
dp[nx][ny][nz] = dp[top.x][top.y][top.z] + 1;
p[nx][ny][nz] = node(top.x,top.y,top.z,')');
q.push(node(nx,ny,nz));
}
}
}
int main() {
scanf("%s%s",s,t);
n = strlen(s);
m = strlen(t);
bfs();
node pi = p[n][m][0];
while(pi.x > 0 || pi.y > 0 || pi.z > 0) {
g.push_back(pi.c);
pi = p[pi.x][pi.y][pi.z];
}
g.push_back(pi.c);
reverse(g.begin(),g.end());
for(auto it : g)
printf("%c",it);
puts("");
return 0;
}