Brackets (poj 2955)
来源:互联网 发布:fdd网络 编辑:程序博客网 时间:2024/05/29 11:57
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
66406
题意:
给出一个由 ( ) [ ] 组成的串,问这个串中有多少个匹配括号。
思路:
用 dp[i][j] 表示 i~j 这个区间内的最大括号匹配数。
如果 s[i] 和 s[j] 匹配,那么很明显有 dp[i][j] = dp[i+1][j-1] + 2;
如果 s[i] 和 s[j] 不匹配,那么我们可以在 i~j 中找一个断点k 将区间分为 i~k 和 k+1~j ,则有
dp[i][j] = max(dp[i][j],dp[i][k] + dp[k+1][j]);
我们可以通过枚举区间长度来进行转移。
#include"iostream"#include"cstring"#include"cstdio"#include"algorithm"using namespace std;char ss[105];int dp[105][105];bool check(int i,int j){ if(ss[i] == '(' && ss[j] == ')') return true; if(ss[i] == '[' && ss[j] == ']') return true; return false;}int main(void){ while(~scanf("%s",ss)) { if(ss[0] == 'e') break; int len = strlen(ss); memset(dp,0,sizeof(dp)); for(int i = 0;i < len-1;i++) { if(check(i,i+1)) dp[i][i+1] = 2; } for(int k = 3;k <= len;k++) { for(int i = 0;i + k - 1 < len;i++) { if(check(i,i+k-1)) dp[i][i+k-1] = dp[i+1][i+k-2] + 2; for(int j = i;j < i + k - 1;j++) dp[i][i+k-1] = max(dp[i][i+k-1],dp[i][j]+dp[j+1][i+k-1]); } } printf("%d\n",dp[0][len-1]); } return 0;}
- Brackets (poj 2955)
- Brackets(poj-2955)(区间dp)
- poj 2955(Brackets)【 区间dp2】
- POJ 2955-Brackets(区间DP)
- poj 2955 Brackets(区间DP)
- POJ 题目2955 Brackets(区间dp)
- poj 2955 Brackets(区间dp)
- POJ 2955 Brackets (区间DP)
- poj 2955 Brackets(区间dp)
- poj 2955 Brackets (区间dp)
- POJ - 2955 Brackets(区间dp)
- POJ 2955 Brackets(区间DP水题)
- POJ 2955 Brackets(区间DP)
- poj--2955--Brackets(区间dp)
- POJ 2955Brackets(区间DP)
- POJ 2955Brackets(区间DP)
- poj 2955 Brackets (区间DP)
- 【POJ 2955】Brackets(区间DP)
- UItextView 换行回收键盘
- 通过链接添加新的tab页
- 全屏视频播放
- 背包问题的二进制优化
- 最不可能放手的时候,最需要放手
- Brackets (poj 2955)
- 51 nod 1002 数塔取数问题
- leetcode 327. Count of Range Sum
- struts2 配置 xheditor
- 圆形带刻度的进度条
- Eclipse报错-->failed to load the jni shared library
- nth-child(n)的IE8兼容问题
- 女孩痛斥北京医院号贩子:300炒到4500,我天!
- 菜鸟学习Cocos2d之 Menu