POJ 2955
来源:互联网 发布:网络道德的原则有 编辑:程序博客网 时间:2024/06/08 01:22
Brackets
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, andif a and b are regular brackets sequences, then ab is a regular brackets sequence.no other sequence is a regular brackets sequenceFor 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
题意
给你一串字符串,判断有多少个括号配对
思路
1 类似POJ 1141 的那道括号匹配问题,这里我们只需要转换一下,求最少加上多少个括号就能使所有的括号匹配,然后用总长度减去需要加上的括号,极为匹配的括号,dp[i][j]表示i道j最少需要加上多少个括号,
代码
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int const INF=0x3fffffff;char s[205];int dp[205][205];int main(){ while(scanf("%s",s)!=EOF&&strcmp(s,"end")!=0){ memset(dp,0,sizeof(dp)); int len=strlen(s); for(int i=0;i<len;++i) dp[i][i]=1; for(int k=1;k<len;++k) for(int i=0;i<len-1;++i){ dp[i][i+k]=INF; if((s[i]=='('&&s[i+k]==')')||(s[i]=='['&&s[i+k]==']')) dp[i][i+k]=dp[i+1][i+k-1]; for(int j=i;j<i+k;++j) dp[i][i+k]=min(dp[i][i+k],dp[i][j]+dp[j+1][i+k]); } printf("%d\n",len-dp[0][len-1]); } return 0;}
0 0
- POJ 2955
- poj 2955
- POJ 2955
- POJ 2955
- POJ 2955
- POJ 2955
- DP poj 2955 Brackets
- poj 2955 brackets
- poj 2955 括号dp
- poj 2955 区间DP
- poj 2955(区间DP)
- POJ 2955 区间dp
- POJ 2955 Brackets
- POJ 2955 区间DP
- POJ 2955 Brackets
- POJ 2955 Brackets
- DP 之 poj 2955
- poj 2955 Brackets
- Hive2.1.1、Hadoop2.7.3 部署
- 类与对象
- 双核处理问题(2017网易春招)
- 5.循环
- 这是一篇markdown教程
- POJ 2955
- Firefox的“httpRequest”插件简单使用
- 模拟下拉框效果
- C++编译器对属性和方法的处理机制
- ajax跨域请求
- RTX移植
- 谷歌的天敌竟然是亚马逊:从开放7-Mic阵列授权说起
- android自定义控件实现太极图,拖动,缩放不超过边界
- Java中的基础----堆与栈的介绍、区别