poj1141 Brackets Sequence

Description Let us define a regular brackets sequence in the following
way:

1. Empty sequence is a regular sequence.
2. If S is a regular sequence, then (S) and [S] are both regular sequences.
3. If A and B are regular sequences, then AB is a regular sequence.

For example, all of the following sequences of characters are regular
brackets sequences:

(), [], (()), ([]), ()[], ()[()]

And all of the following character sequences are not:

(, [, ), )(, ([)], ([(]

Some sequence of characters ‘(‘, ‘)’, ‘[‘, and ‘]’ is given. You are
to find the shortest possible regular brackets sequence, that contains
the given character sequence as a subsequence. Here, a string a1 a2
… an is called a subsequence of the string b1 b2 … bm, if there
exist such indices 1 = i1 < i2 < … < in = m, that aj = bij for all 1
= j = n.

Input The input file contains at most 100 brackets (characters ‘(‘,
‘)’, ‘[’ and ‘]’) that are situated on a single line without any other
characters among them.

Output Write to the output file a single line that contains some
regular brackets sequence that has the minimal possible length and
contains the given sequence as a subsequence.

对于一段区间i..j，有两种转移：一个是【如果两端组成一对括号】转移到i+1..j-1，另一个是分成两部分，转移到i..k和k+1..j。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[110];
int dp[110][110];
void prt(int l,int r)
{
    int k;
    if (l>r) return;
    if (l==r)
    {
        if (s[l]=='('||s[l]==')') printf("()");
        else printf("[]");
        return;
    }
    if ((s[l]=='('&&s[r]==')')||(s[l]=='['&&s[r]==']'))
    {
        if (dp[l][r]==dp[l+1][r-1])
        {
            printf("%c",s[l]);
            prt(l+1,r-1);
            printf("%c",s[r]);
            return;
        }
    }
    for (k=l;k<=r;k++)
      if (dp[l][r]==dp[l][k]+dp[k+1][r])
      {
        prt(l,k);
        prt(k+1,r);
        return;
      }
}
int main()
{
    int i,j,k,m,n,p,q,x,y,z,len;
    gets(s+1);
    n=strlen(s+1);
    memset(dp,0x3f,sizeof(dp));
    for (i=1;i<=n;i++)
      dp[i][i]=1,dp[i+1][i]=0;
    for (len=2;len<=n;len++)
      for (i=1;(j=i+len-1)<=n;i++)
      {
        if ((s[i]=='('&&s[j]==')')||(s[i]=='['&&s[j]==']')) dp[i][j]=dp[i+1][j-1];
        for (k=i;k<j;k++)
          dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]);
      }
    prt(1,n);
    printf("\n");
}