poj 2955 Brackets

Brackets Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8648   Accepted: 4625 Description 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 Source Stanford Local 2004

求一串括号中匹配的括号数

dp[i][j]代表从i到j中的匹配的括号数，那么从i到j中可以拆成dp[i][k]+dp[k+1][j]的形式，k属于i到j，取最大即可。

#include<iostream>
#include<cstring>
#include<string> 
#include<cstdio>
using namespace std;
const long long int  N=10000007;
int main(){
	int n;
	string a;
	while(cin>>a)
	{ 
        if(a=="end")break;
		 int dp[222][222];
		 memset(dp,0,sizeof(dp));
	     int i,j,k;
	     for(i=1;i<a.size();i++)
	     {
	         for(j=0,k=i;k<a.size();j++,k++)
	         {
	         	if(a[j]=='('&&a[k]==')'||a[j]=='['&&a[k]==']')
	         	dp[j][k]=dp[j+1][k-1]+2;
	         	for(int s=j;s<k;s++)
	         	{
	         		dp[j][k]=max(dp[j][k],dp[j][s]+dp[s+1][k]);
				 }
			 }
		 }
		 cout<<dp[0][a.size()-1]<<endl;
	}
	return 0;
}