poj--1141 Brackets Sequence(dp)

poj 1141

题解

设阶段 r 为子序列的长度，状态 i 为当前子序列的首指针，则尾指针为 j = i + r，设当前子序列 $s_i .... s_j$需要添加的最少字符数为 dp[i][j]。
初始条件：dp[i][i] = 1
状态转移：
* 当 (s[i] == '(' && s[j] == ')') || (s[i] == '[' && s[j] == ']')，dp[i][j] = dp[i + 1][j - 1]
* 否则，需要枚举中间指针 k(i <= k < j)，dp[i][j] = min(dp[i][k] + dp[k + 1][j] | i <= k < j)

用一张记忆表path[][]存储所有子问题的解：若 $s_i$ 与 $s_j$ 配对，path[i][j] = -1，否则，path[i][j] = 左右子序列的最佳划分位置

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn = 105;
const int inf  = 0x7fffffff;
int   dp[maxn][maxn], path[maxn][maxn];
char  s[maxn];

void print(int i, int j)
{
    if(i > j) return;
    if(i == j){
        if(s[i] == '[' || s[i] == ']') printf("[]");
        else printf("()");
    }
    else if(path[i][j] == -1){
        printf("%c", s[i]);
        print(i + 1, j - 1);
        printf("%c", s[j]);
    }
    else{
        print(i, path[i][j]);
        print(path[i][j] + 1, j);
    }
}

void solve()
{
    int n = strlen(s);
    memset(dp, 0, sizeof(dp));
    for(int i = 0; i < n; ++i) dp[i][i] = 1;
    for(int r = 1; r < n; ++r){
        for(int i = 0; i < n - r; ++i){
            int j = i + r;
            dp[i][j] = inf;
            if((s[i] == '(' && s[j] == ')') || (s[i] == '[' && s[j] == ']')){
                dp[i][j] = min(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;
                }
            }
        }
    }
    print(0, n - 1);
    printf("\n");
}

int main()
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
#endif // LOCAL
    while(gets(s)){
        solve();
    }
    return 0;
}