题目链接:http://poj.org/problem?id=2955 Brackets
Description We give the following inductive definition of 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 a1a2 …an, your goal is to find the length of the longest regular brackets sequence that is a subsequence ofs. That is, you wish to find the largestm such that for indicesi1,i2, …,im where 1 ≤i1 <i2 < … <im ≤n, ai1ai2 … aim is a regular brackets sequence. Given 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 Sample Output Source 题意:求最大括号匹配数,( )、[ ]. 若i、j不匹配,则dp[i][j] = dp[i + 1][j];若i、j匹配,则dp[i][j] = max{dp[i][k] + dp[k + 1][j]} + 2. |
POJ 2955 Brackets(括号匹配-区间DP)
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/June_Xixi/article/details/76099297
猜你喜欢
转载自blog.csdn.net/June_Xixi/article/details/76099297
今日推荐
周排行