[黑书 - 动态规划] 例题1 - 括号序列

POJ1141 - Brackets Sequence

状态转移方程：

Dp(i, j) = Dp(i + 1, j - 1) if (si = sj)

             = Dp(i, k) + Dp(k + 1, j) if (si != sj); 

边界条件：

Dp(i, j) = 1 if (i = j)

Dp(i, j) = 0 if (i > j)

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#define INF ((int)(1e9))
using namespace std;
int dp[110][110], vis[110][110], path[110][110];
string str;
int solve(int i, int j) {
	if (i > j) return dp[i][j] = 0;
	if (i == j) return dp[i][j] = 1;
	if (vis[i][j]) return dp[i][j];
	int res = INF;
	if ((str[i] == '(' && str[j] == ')') || (str[i] == '[' && str[j] == ']')) {
		int tmp = solve(i+1, j-1);
		if (tmp < res) {
			path[i][j] = -1;
			res = tmp;
		}
	}
	for (int k = i; k < j; ++ k) {
		int tmp = solve(i,k) + solve(k+1,j);
		if (tmp < res) {
			path[i][j] = k;
			res = tmp;
		}
	}
	dp[i][j] = res;
	vis[i][j] = 1;
	return res;
}
void print(int i, int j) {
	if (i > j) return;
	if (i == j) {
		if (str[i] == '(' || str[i] == ')') cout << "()";
		else cout << "[]";
		return;
	}
	if (path[i][j] == -1) {
		cout << str[i];
		print(i+1, j-1);
		cout << str[j];
	}
	else {
		print(i, path[i][j]);
		print(path[i][j]+1, j);
	}
}
int main() {
    #ifdef LOCAL
        freopen("data.in", "r", stdin);
    #endif // LOCAL
	while (getline(cin, str)) {
		memset(vis, 0, sizeof(vis));
		memset(dp, 0, sizeof(dp));
		memset(path, 0, sizeof(path));
		solve(0, str.length()-1);
		print(0, str.length()-1); cout << endl;
	}
}