Week12 作业 D - 选做题 - 1

We give the following inductive definition of a “regular brackets” sequence:
the empty sequence is a regular brackets sequence,
if s is a regular brackets sequence, then (s) and [s] are regular brackets sequences, and
if a and b are regular brackets sequences, then ab is a regular brackets sequence.
no other sequence is a regular brackets sequence
For instance, all of the following character sequences are regular brackets sequences:
(), [], (()), ()[], ()[()]
while the following character sequences are not:
(, ], )(, ([)], ([(]
Given a brackets sequence of characters a1a2 … an, your goal is to find the length of the longest regular brackets sequence that is a subsequence of s. That is, you wish to find the largest m such that for indices i1, i2, …, im where 1 ≤ i1 < i2 < … < im ≤ n, ai1ai2 … aim is a regular brackets sequence.
Given the initial sequence ([([]])], the longest regular brackets subsequence is [([])].
Input
The input test file will contain multiple test cases. Each input test case consists of a single line containing only the characters (, ), [, and ]; each input test will have length between 1 and 100, inclusive. The end-of-file is marked by a line containing the word “end” and should not be processed.
Output
For each input case, the program should print the length of the longest possible regular brackets subsequence on a single line.
Sample Input
((()))
()()()
([]])
)[)(
([][][)
end
Sample Output
6
6
4
0
6
解题思路：
令f[i][j]表示子序列[i,j]的最长合法序列的括号对数 。
1.f[i][j]=max{f[i][k]+f[k+1][j],(i<=k<j)}对以下取max ：
2.[S’]或(S’)：f[i+1][j-1]+1
3.[S’或(S’：f[i+1][j]
4.S’]或S’)：f[i][j-1]
其中34情况包含于1,可不写。
最后答案是序列长度，应该是f[0][n-1]*2，因为数组中存的是括号对数。

#include <iostream>
#include <string>
using namespace std;
string s;
int f[120][120];
int main()
{
	while(1)
	{
		cin>>s;
		if(s=="end")  break;
		int n=s.size();
		for(int i=0;i<=n;i++)
			for(int j=0;j<=n;j++)
				f[i][j]=0; 
		for(int len=2;len<=n;len++)
		{
			for(int i=0;i<n-len+1;i++)
			{
				int l=i,r=i+len-1;
				for(int k=l;k<r;k++)
				{
					f[l][r]=max(f[l][k]+f[k+1][r],f[l][r]);
				}
				if(s[l]=='['&&s[r]==']')
					f[l][r]=max(f[l+1][r-1]+1,f[l][r]);
				if(s[l]=='('&&s[r]==')')
					f[l][r]=max(f[l+1][r-1]+1,f[l][r]);	
			}
		}
		cout<<f[0][n-1]*2<<endl;	
	}
}