Submission #1835295

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 25)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl

//ここから編集する


int main() {
    string s;
    cin >> s;
    int N = s.size();

    int dp[105][105][105];
    rep(i,0,N+1){
        rep(j,0,N+1){
            rep(k,0,N+1){
                dp[i][j][k] = INF;
            }
        }
    }
    dp[0][0][0] = 0;
    rep(i,0,N+1){
        rep(j,0,i+1){
            rep(k,0,i+1){
                if(k - 1 >= 0){
                    if(s[i] == '('){
                        dp[i+1][i+1][k-1] = min(dp[i][j][k]+1,dp[i+1][i+1][k-1]);
                    }else{
//                        dp[i+1][i][k-1] = min(dp[i][j][k],dp[i+1][i][k-1]-1);
                        dp[i+1][j][k-1] = min(dp[i][j][k],dp[i+1][i][k-1]);
                    }
                }
//                if(k + 1 <= N){
                    if(s[i] == '('){
                        dp[i+1][j][k+1] = min(dp[i][j][k],dp[i+1][i][k+1]);
                    }else{
                        dp[i+1][i+1][k+1] = min(dp[i][j][k]+1,dp[i+1][i+1][k+1]);
                    }
//                }
            }
        }
    }

    int ans = 114514;
    rep(j,0,N+1){
        ans = min(ans,j-1 + dp[N][j][0]);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result