72 lines
1.2 KiB
C++
72 lines
1.2 KiB
C++
#include<cstdio>
|
|
#include<cstring>
|
|
#include<algorithm>
|
|
using namespace std;
|
|
const int maxn=100+5;
|
|
char S[maxn];
|
|
int n,d[maxn][maxn];
|
|
inline bool match(const char& a,const char& b)
|
|
{
|
|
return (a=='('&&b==')')||(a=='['&&b==']');
|
|
}
|
|
void dp()
|
|
{
|
|
for(int i = 0; i < n; i++)
|
|
{
|
|
d[i+1][i] = 0;
|
|
d[i][i] = 1;
|
|
}
|
|
for(int i = n-2; i >= 0; i--)
|
|
for(int j = i+1; j < n; j++)
|
|
{
|
|
d[i][j] = n;
|
|
if(match(S[i], S[j])) d[i][j] = min(d[i][j], d[i+1][j-1]);
|
|
for(int k = i; k < j; k++)
|
|
d[i][j] = min(d[i][j], d[i][k] + d[k+1][j]);
|
|
}
|
|
}
|
|
|
|
void print(int i, int j)
|
|
{
|
|
if(i > j) return;
|
|
if(i == j)
|
|
{
|
|
if(S[i] == '(' || S[i] == ')') printf("()");
|
|
else printf("[]");
|
|
return;
|
|
}
|
|
int ans = d[i][j];
|
|
if(match(S[i], S[j]) && ans == d[i+1][j-1])
|
|
{
|
|
printf("%c", S[i]); print(i+1, j-1);
|
|
printf("%c", S[j]);
|
|
return;
|
|
}
|
|
for(int k = i; k < j; k++)
|
|
if(ans == d[i][k] + d[k+1][j])
|
|
{
|
|
print(i,k);
|
|
print(k+1,j);
|
|
return;
|
|
}
|
|
}
|
|
int main()
|
|
{
|
|
int T;
|
|
fgets(S,maxn,stdin);
|
|
sscanf(S,"%d",&T);
|
|
fgets(S,maxn,stdin);
|
|
while(T--)
|
|
{
|
|
fgets(S,maxn,stdin);
|
|
n=strlen(S)-1;
|
|
memset(d, -1, sizeof(d));
|
|
dp();
|
|
print(0, n-1);
|
|
printf("\n");
|
|
if(T) printf("\n");
|
|
fgets(S,maxn,stdin);
|
|
}
|
|
return 0;
|
|
}
|