Seinfeld

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1771    Accepted Submission(s): 861

Problem Description

I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one.
You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:
1. An empty string is stable.
2. If S is stable, then {S} is also stable.
3. If S and T are both stable, then ST (the concatenation of the two) is also stable.
All of these strings are stable: {}, {}{}, and {{}{}}; But none of these: }{, {{}{, nor {}{.
The only operation allowed on the string is to replace an opening brace with a closing brace, or visa-versa.

 

Input

Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a non-empty string of opening and closing braces and nothing else. No string has more than 2000 braces. All sequences are of even length.
The last line of the input is made of one or more ’-’ (minus signs.)

 

Output

For each test case, print the following line:
k. N
Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.
Note: There is a blank space before N.

 

Sample Input

}{{}{}{}{{{}---

 

Sample Output

1. 22. 03. 1

#include <iostream>#include <stack>#include <string.h>using namespace std;int main(){    int cases = 1;    char a[2005];    while(cin >> a && a[0] != '-'){        int len = strlen(a), sum = 0;        stack<char> s;        for(int i = 0; i < len; i++){            if(a[i] == '{')    s.push(a[i]);            else if(s.empty())  { sum++; s.push('{');}//每遇到一个无法匹配的右括号必定要经过一次操作,把右括号变成左括号放入栈中            else   s.pop();//如果栈中有左括号，那么就与右括号相配        }        //最后，栈中剩余未经匹配的左括号两两相互配对，那么只需要操作 s.size() / 2 次就可以        sum += s.size() / 2;        cout << cases++ << ". " << sum << endl;    }    return 0;}