Language: Default Brackets Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2686 Accepted: 1394 Description We give the following inductive definition of a “regular brackets” sequ

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 bracke

Brackets Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12763 Accepted: 6776 Description We give the following inductive definition of a “regular brackets” sequence: the empty sequence

— 题目大意：给出一个括号序列，求出其中匹配的括号数 ((()))  6 ()()()  6 — ([]])  4 — )[)(   0 ([][][)  6 — 第一步：确定状态 —dp[i][j]表示a[i]……a[j]的串中，有多少个已经匹配的括号 —第二步：确定状态转移方程 — 如果 a[i] 与 a[k