集训第五周动态规划 J题 括号匹配
2015-08-12 21:47
316 查看
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
Input
The input test file will contain multiple test cases. Each input test case consists of a single line containing only the characters
Output
For each input case, the program should print the length of the longest possible regular brackets subsequence on a single line.
Sample Input
Sample Output
O(O_O)O
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 求括号能够正确匹配的括号个数 dp(i,j)表示区间ij内的正确括号个数 dp(i,j)=max{dp(i+1,j-1)+2 (仅当外层括号匹配),dp(i,k)+dp(k,j)(进行内层括号检查)}
#include"iostream" #include"cstring" using namespace std; int dp[110][110]; string a; void Work() { int len=a.length(); //cout<<len<<endl; memset(dp,0,sizeof(dp)); int ans=0; for(int i=0;i<len;i++) { for(int j=0,k=i;k<len;k++,j++) { if((a[j]=='('&&a[k]==')')||(a[j]=='['&&a[k]==']')) dp[j][k]=dp[j+1][k-1]+2; for(int t=j+1;t<k;t++) if(dp[j][t]+dp[t][k]>dp[j][k]) dp[j][k]=dp[j][t]+dp[t][k]; if(dp[j][k]>ans) ans=dp[j][k]; } } cout<<ans<<endl; } int main() { while(cin>>a) { if(a=="end") break; Work(); } return 0; }
O(O_O)O
相关文章推荐
- [Leetcode]Palindrome Number
- 刨根问底--action属性赋值过程分析
- 用一个数来保存多个开关
- SecureCRT 绝佳配色方案, 保护你的眼睛
- Java学习之路0811(预编译、事务、web项目)
- 对象和数组(8.11)
- 没做过编译器就是被人欺——从一道变态的类型转换题猜编译器的行为(指针直接调用自己的非虚函数,当时是什么类型就是什么,但数据成员仍用自己的)
- Delphi FastReport动态加载图片 (转载)
- c++函数指针与默认参数
- 递归求n!
- Longest Run on a Snowboard
- 使用直方图统计像素
- SDUT 1124-飞跃荒野(三维BFS)
- lucene003_lucene的索引文件格式
- 数据库SQL优化大总结之 百万级数据库优化方案
- 在此页上的 ActiveX 控件和本页上的其它部份的交互可能不安全
- 【Struts2学习笔记-4】包含其他配置文件
- CXF简单示例(一)
- MySQL5.6主从复制(读写分离)
- 工具类:MD5加密