每日AC（之前断了，现在补上）

#include <iostream>
#include <vector>
#include <string>
#include <climits>
using namespace std;

int minInsertionsToGBE(string s) {
	int n = s.size();
	vector<vector<int>> dp(n, vector<int>(n, 0));

	for (int i = 0; i < n; ++i) {
    		dp[i][i] = 1;
	}

	for (int len = 2; len <= n; ++len) {
    		for (int i = 0; i <= n - len; ++i) {
        		int j = i + len - 1;
        		dp[i][j] = INT_MAX;
        		if ((s[i] == '[' && s[j] == ']') || (s[i] == '(' && s[j] == ')')) {
            			dp[i][j] = (i + 1 <= j - 1) ? dp[i+1][j-1] : 0;
        		}
        		for (int k = i; k < j; ++k) {
            			dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j]);
        		}
    			}
		}

	return dp[0][n-1];
}

int main() {
	string BE;
	cin >> BE;
	cout << minInsertionsToGBE(BE) << endl;
	return 0;
}