1000. Clumsy Cows

1000. Clumsy Cows
Total:	71	Accepted:	33



Time Limit: 1sec    Memory Limit:256MB
Description
Bessie the cow is trying to type a balanced string of parentheses into her new laptop, but she is sufficiently clumsy (due to her large hooves) that she keeps mis-typing characters.  Please help her by computing the minimum number of characters in the string that one must reverse (e.g., changing a left parenthesis to a right parenthesis, or vice versa) so that the string would become balanced.
 There are several ways to define what it means for a string of parentheses to be "balanced".  Perhaps the simplest definition is that there must be the same total number of ('s and )'s, and for any prefix of the string, there must be at least as many ('s as )'s. 
 For example, the following strings are all balanced:
()
(())
()(()())
 while these are not:
)(
())(
((())))
Input
* Line 1: A string of parentheses of even length at most 100,000 characters.
Output
 Line 1: A single integer giving the minimum number of parentheses that must be toggled to convert the string into a balanced string.
Sample Input
 Copy sample input to clipboard
())(
Sample Output
2


这题在做比赛的时候自己没有想出来，后来请教了一下教主，然后告诉了思路，但是估计自己还是没有听懂，然后和同学分享了一下
不一会儿同学就按照教主的思路AC了，然后帮我讲了一下思路，擦擦，原来是这样，就是把配对的删掉，具体见代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
const int N=100005;
char x[N];
int main()
{
    while(scanf("%s",x)!=EOF)
    {
        int xlen=strlen(x);
        int sum=0,sum1=0;
        for(int i=0; i<xlen; i++)
        {
            if(x[i]=='(')
            {
                sum++;
            }
            else if(sum&&x[i]==')')
            {
                sum--;
            }
            else if(sum==0&&x[i]==')')
            {
                sum++;
                sum1++;
                x[i]='(';
            }
        }
        printf("%d\n",sum/2+sum1);
    }
    return 0;
}