Submission #1767746

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>

using namespace std;

int N;
string S;
int ruisekiwa[100];

int main() {
	cin >> N;
	cin >> S;
	ruisekiwa[0] = S[0] == '(' ? +1 : -1;
	for (int i = 1; i < S.size(); i++) {
		if (S[i] == '(')ruisekiwa[i] += ruisekiwa[i - 1] + 1;
		else ruisekiwa[i] += ruisekiwa[i - 1] - 1;
	}

	string mae, ato;
	for (int i = 0; i < S.size(); i++) {
		if (ruisekiwa[i] < 0) {
			mae += '(';
			for (int j = i + 1; j < S.size(); j++) {
				ruisekiwa[j]++;
			}
		}
	}
	for (int i = 0; i < ruisekiwa[S.size() - 1]; i++) {
		ato += ')';
	}
	cout << mae + S + ato << endl;
	return 0;
}

Submission Info

Judge Result