E.cpp

#define FAST_ALLOCATOR_MEMORY 1e8
#include "optimization.h"
#include <iostream>
#include <cstdio>
#include <unordered_map>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstring>
using namespace std;
char str[101];
int a[101][101];
map<char, char> rev;
int c(int start, int len){
    if(a[start][len]) return a[start][len];
    if (len - start == 1) return 0;
    int cnt = 0;
    for (int i = start; i < start + len; i++)
        for (int j = i + 1; j < start + len; j++){
            if (rev[str[i]] == str[j]){
                cnt = max(cnt, c(i + 1, j - i - 1) + c(j + 1, start + len - j - 1) + 2);
            }
        }
    a[start][len] = cnt;
    return cnt;
}
int main()
{
    rev['('] = ')';
    rev['['] = ']';
    rev['{'] = '}';
    freopen("erase.in", "r", stdin);
    freopen("erase.out", "wt", stdout);
    readWord(str);
    int n = strlen(str);
    int ans = c(0, n);
    cout << ans << endl;
    return 0;

}