程序设计思维与实践 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.

Example

Input
((()))
()()()
([]])
)[)(
([][][)
end

Output
6
6
4
0
6

思想

• 定义dp [ i ] [ j ] 为串中第 i 个到第 j 个括号的最大匹配数目
• 假如第 i 个和第 j 个是一对匹配的括号则有 dp [ i ] [ j ] = dp [ i+1 ] [ j-1 ] + 2
• 由此可知我们只需用上面的式子枚举所有括号范围i，j中的括号数目，再更新dp [ i ] [ j ] 的最大值即可
• 枚举i，j中间的所有点，更新最大值

for(int p=j;p<k;p++)
{
	dp[j][k]=max(dp[j][p]+dp[p+1][k],dp[j][k]);
}

代码

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <queue>
using namespace std;
const int N=1000;
int dp[N][N];
char str[N];

int main()
{
	while(~scanf("%s",str)&&str[0]!='e')
	{
		memset(dp,0,sizeof(dp));
		int n=strlen(str);
		for(int i=1;i<=n;i++)
		{
			for(int j=0,k=i;j<k,k<=n;j++,k++)
			{
				if((str[j]=='('&&str[k]==')')||(str[j]=='['&&str[k]==']'))
				{
					dp[j][k]=max(dp[j][k],dp[j+1][k-1]+2);
				}
				for(int p=j;p<k;p++)
				{
					dp[j][k]=max(dp[j][p]+dp[p+1][k],dp[j][k]);
				}
			}
		}
		printf("%d\n",dp[0][n-1]);
	 } 
	return 0; 
 }