Description: POJ 1141 subject source code + source code
To give you a sequence of brackets that will give you a minimum of the sequence black book that allows the parentheses to be valid
Thought: dp[a][b] represents the minimum number of filling sequences required for a b
A = = b when dp a> [a] [b] = 1; B when dp [a] [b] = 0
S [a] is paired with s[b] [b]=dp[a+1][b-1]
Otherwise the dp [a] [b] = min (dp [a] [k], dp [k + 1] [b]) a< = k< b
The record path takes the general DP record path
To Search:
File list (Check if you may need any files):
poj1141.txt
Download