Brackets sequence UVA - 1626 

参考刘汝佳代码写的

加了一点点注释

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<assert.h>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<sstream>
#include<stack>
#include<queue>
#include<string>
#include<bitset>
#include<algorithm>
#pragma warning(disable:4996)
#define me(s)  memset(s,0,sizeof(s))
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define Max(a,b) (a)>(b)?(a):(b);
#define Min(a,b) (a)<(b)?(a):(b);
using namespace std;
typedef pair <int, int> P;
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = { 0, -1, 0, 1, -1, -1, 1, 1 };
const int dc[] = { -1, 0, 1, 0, -1, 1, -1, 1 };
const int MOD = 1e9 + 7;
const double pi = acos(-1.0);
const double eps = 1e-15;
const int MAXN = 1000 + 10;
const int MAXT = 100 + 10;
int d[MAXT][MAXT], n;
string s;
bool match(char a, char b)
{
	return (a == '(' && b == ')') || (a == '[' && b == ']');
}
void print(int i, int j)
{
	if (i > j) return;
	if (i == j) {
		if (s[i] == '(' || s[i] == ')') printf("()");
		else printf("[]");
		return;
	}
	int ans = d[i][j];
	if (match(s[i], s[j]) && ans == d[i + 1][j - 1]) {
		cout << s[i];
		print(i + 1, j - 1);
		cout << s[j];
		return;
	}
	for (int k = i; k < j; k++)
		if (ans == d[i][k] + d[k + 1][j]) {
			print(i, k); print(k + 1, j);
			return;
		}

}
void dp()
{
	//注意dp状态的定义，d[i][j]表示数组小标从i到j需要加的最少括号，是闭区间
	//所以这里d[i][i]==1，而d[i + 1][i] == 0
	for (int i = 0; i < n; i++) {
		d[i][i] = 1;
		d[i + 1][i] = 0;
	}
	//逆推正推都是可以的，关键在于第二个循环
	//大区间得出最优解依赖于小区间，所以枚举时区间要从小到大
	/*for(int i=n-2;i>=0;i--)
		for (int j = i + 1; j < n; j++) {
			d[i][j] = n;
			if (match(s[i], s[j])) d[i][j] = d[i + 1][j - 1];
			for (int k = i; k < j; k++)
				d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j]);
			cout << i << ' ' << j << ' ' << d[i][j] << endl;
		}
	cout << endl;*/
	//正推的做法
	for (int i = 1; i <= n - 1; i++)
		for (int j = i - 1; j >= 0; j--) {
			d[j][i] = n;
			if (match(s[j], s[i])) d[j][i] = d[j + 1][i - 1];
			for (int k = i; k > j; k--)
				d[j][i] = min(d[j][i], d[j][k - 1] + d[k][i]);
			//cout << j << ' ' << i << ' ' << d[j][i] << endl;
		}
}
int main()
{
	int T;
	cin >> T;
	getchar();
	while (T--)
	{
		getline(cin, s);
		getline(cin, s);
		n = s.length();
		dp();
		print(0, n - 1);
		puts("");
		if (T) puts("");
	}
}