Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Brackets
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 s. That is, you wish to find the largest m such that for indices i_{1}, i_{2}, …, i where 1 ≤ _{m}i_{1} < i_{2} < … < i ≤ _{m}n, a1_{i}a2 … _{i}a is a regular brackets sequence._{i}mGiven 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 ((())) ()()() ([]]) )[)( ([][][) end Sample Output 6 6 4 0 6 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator