poj 1141【dp--记录路径】
2011-09-25 21:58
507 查看
Brackets Sequence
Description
Let us define a regular brackets sequence in the following way:
1. Empty sequence is a regular sequence.
2. If S is a regular sequence, then (S) and [S] are both regular sequences.
3. If A and B are regular sequences, then AB is a regular sequence.
For example, all of the following sequences of characters are regular brackets sequences:
(), [], (()), ([]), ()[], ()[()]
And all of the following character sequences are not:
(, [, ), )(, ([)], ([(]
Some sequence of characters '(', ')', '[', and ']' is given. You are to find the shortest possible regular brackets sequence, that contains the given character sequence as a subsequence. Here, a string a1 a2 ... an is called a subsequence of the string b1 b2
... bm, if there exist such indices 1 = i1 < i2 < ... < in = m, that aj = bij for all 1 = j = n.
Input
The input file contains at most 100 brackets (characters '(', ')', '[' and ']') that are situated on a single line without any other characters among them.
Output
Write to the output file a single line that contains some regular brackets sequence that has the minimal possible length and contains the given sequence as a subsequence.
Sample Input
Sample Output
Source
Northeastern Europe 2001
Time Limit: 1000MS | Memory Limit: 65536K | |||
Total Submissions: 16818 | Accepted: 4571 | Special Judge |
Let us define a regular brackets sequence in the following way:
1. Empty sequence is a regular sequence.
2. If S is a regular sequence, then (S) and [S] are both regular sequences.
3. If A and B are regular sequences, then AB is a regular sequence.
For example, all of the following sequences of characters are regular brackets sequences:
(), [], (()), ([]), ()[], ()[()]
And all of the following character sequences are not:
(, [, ), )(, ([)], ([(]
Some sequence of characters '(', ')', '[', and ']' is given. You are to find the shortest possible regular brackets sequence, that contains the given character sequence as a subsequence. Here, a string a1 a2 ... an is called a subsequence of the string b1 b2
... bm, if there exist such indices 1 = i1 < i2 < ... < in = m, that aj = bij for all 1 = j = n.
Input
The input file contains at most 100 brackets (characters '(', ')', '[' and ']') that are situated on a single line without any other characters among them.
Output
Write to the output file a single line that contains some regular brackets sequence that has the minimal possible length and contains the given sequence as a subsequence.
Sample Input
([(]
Sample Output
()[()]
Source
Northeastern Europe 2001
#include <iostream> using namespace std; char s[102]; int dp[110][110], path[110][110]; const int inf = 0xffffff; void output(int i, int j) { if (i > j) return; if (i == j) { if (s[i] == '(' || s[j] == ')') printf("()"); else printf("[]"); } else if (path[i][j] == -1) { printf("%c",s[i]); output(i+1,j-1); printf("%c",s[j]); } else { output(i,path[i][j]); output(path[i][j]+1,j); } } int main() { scanf("%s",s); memset(dp,0,sizeof(dp)); int n = strlen(s); for (int i = 0; i < n; ++i) dp[i][i] = 1; for (int p = 1; p < n; ++p) for (int i = 0; i < n-p; ++i) { int j = i+p; dp[i][j] = inf; if ((s[i] == '(' && s[j] == ')') || (s[i] == '[' && s[j] == ']')) if(dp[i][j]>dp[i+1][j-1]) dp[i][j]=dp[i+1][j-1],path[i][j]=-1; for (int k = i; k < j; ++k) { if (dp[i][j] > dp[i][k] + dp[k+1][j]) { dp[i][j] = dp[i][k] + dp[k+1][j]; path[i][j] = k; } } } output(0,n-1); printf("\n"); return 0; }
相关文章推荐
- POJ 1141 Brackets Sequence(记录路径的dp)
- POJ 1141 Brackets Sequence(区间DP记录路径)
- POJ--1141--Brackets Sequence--记录DP路径
- POJ 1141 Brackets Sequence (区间dp 记录路径)
- poj 1141 Brackets Sequence(区间DP记录路径)
- poj 1141 (区间dp记录路径问题)
- poj 1141 Brackets Sequence 【区间DP+路径记录】
- poj1141 Brackets Sequence(区间dp记录路径问题)
- POJ 3373 Changing Digits(记录路径的dp)
- POJ 1141 Brackets Sequence (DP+路径处理)
- 区间dp模型之括号匹配打印路径 poj(1141)
- (常复习)poj 1015 dp+记录dp路径+转变最优子结构+区间映射
- poj 2250 Compromise (DP-LCS 记录路径)
- POJ 1141 / UVa 1626 Brackets Sequence (区间DP&打印路径)
- uva1626 poj 1141 Brackets Sequence 区间dp 打印路径
- POJ 1141 Brackets Sequence(区间DP, DP打印路径)
- POJ 1141-Brackets Sequence(区间dp括号匹配打印路径)
- poj 1141(区间dp+打印路径)
- POJ 2264 Advanced Fruits DP+记录路径
- POJ 1141 Brackets Sequence(区间DP + 打印路径)