POJ 1141 Brackets Sequence（区间DP）

题意：给出一串包含()[]的字符串你，你可以在任何位置添加()或者[]，输出使得这个串合法的最终字符串

思路：令dp[i][j]为i字符到j字符需要添加符号的最小个数，那么如果s[i]==s[j]，说明他们已经匹配了，那么只需考虑i+1到j-1个字符，那么dp[i][j]=dp[i+1][j-1];  一般的，我们把i到j分成i到k，k+1到j的两个子序列，if (dp[i][j] > dp[i][kk]+dp[kk+1][j]) dp[i][j]=dp[i][kk]+dp[kk+1][j];path[i][j]=kk;

           这道题难在输出路径，如果s[i]==s[j]，那么就将路径置为-1，表示他们是匹配的，如果不同，就记录路径分割点，在输出的时候i=j;则此时i,j指的就是一个单个字符，如果s[i]='('or')'直接输出一对括号即可。等于'['同上。但是一般的情况都是i,j中间还有字符，要分两种情况，如果path[i][j]=-1;即标记时s[i]、s[j]是一对，此时输出s[i],s[i+1]..s[j-1],s[j]即可。如果更一般的情况即path[i][j]不等于-1的时候就是说s[i]..s[j]已经在i,j中间分开，那么仍然是递归输出s[i]...s[path[i][j]],s[path[i][j]+1]...s[j]即可。至此输出完成。

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 400
#define LL long long
#define inf 1e9
int cas=1,T;
int dp[maxn][maxn];
int path[maxn][maxn];
string s1;
char s[maxn];
void print(int i,int j)
{
	if (i>j)
		return;
	if (i==j)
	{
		if (s[i]=='(' || s[j]==')')
			printf("()");
		else
			printf("[]");
	}
	else if (path[i][j]==-1)
	{
	    printf("%c",s[i]);
		print(i+1,j-1);
		printf("%c",s[j]);
	}
	else
	{
		print(i,path[i][j]);
		print(path[i][j]+1,j);
	}
}
int main()
{
//	string s1;
	while (gets(s)!=NULL)
	{
        memset(dp,0,sizeof(dp));
//		memset(path,0,sizeof(path));
//		int len=s1.size();
        int len = strlen(s);
		for (int i = 0;i<len;i++)
			dp[i][i]=1;
		for (int k=1;k<len;k++)
		{
			for (int i = 0,j=k;i<len,j<len;i++,j++)
			{
				dp[i][j]=inf;
                if (s[i]=='(' && s[j]==')' || s[i]=='['&&s[j]==']')
					dp[i][j]=dp[i+1][j-1],path[i][j]=-1;
                for (int kk=i;kk<j;kk++)
					if (dp[i][j] > dp[i][kk]+dp[kk+1][j])
					{
						dp[i][j]=dp[i][kk]+dp[kk+1][j];
						path[i][j]=kk;
					}
			}
		}
		print(0,len-1);
		printf("\n");
//		printf("%d\n",dp[0][len-1]);
	}
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

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.

Sample Input

([(]

Sample Output

()[()]