# 【BZOJ】3016: [Usaco2012 Nov]Clumsy Cows

## 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:
)(
())(
((())))

()是合法的；
A是合法的，则(A)是合法的；
AB都是合法的，则AB是合法的。

一个长度为n个括号序列。

())(

## Sample Output

2

100%的数据满足：1 <= n <= 100,000。

## Source

Silver

直接乱搞。。我们发现，当一个括号序列合法的时候，当且仅当这个序列的每一个位置之前的所有左括号的个数都大于等于右括号的个数，所以我们可以用计数器模拟一个类似栈的东西，然后如果栈内元素为0（即之前所有左右括号数目相等），如果这个时候来的是右括号的时候，我们就可以判定为要改变这个括号。最后把栈内的多余的左括号的一半改成右括号就可以了

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAXN=10001;
int main(int argc, char *argv[])
{
int d=0,n,i;
int ans=0;
char x;
while(cin>>x)
{
if(x=='(') d++;
else if(x==')'&&d>=1) d--;
else if(x==')'&&d==0) ans++,d++;
}
ans+=(d+1)/2;
printf("%d\n",ans);
return 0;
}


• 本文已收录于以下专栏：

## 3016: [Usaco2012 Nov]Clumsy Cows

Description Bessie the cow is trying to type a balanced string of parentheses into her new laptop...

## BZOJ 2060: [Usaco2010 Nov]Visiting Cows 拜访奶牛

Description 经过了几周的辛苦工作,贝茜终于迎来了一个假期.作为奶牛群中最会社交的牛,她希望去拜访N(1C2).这样,在每一对奶牛之间都有一条唯一的通路. FJ希望贝茜尽快的回到农场....

## [Usaco2013 Nov]Crowded Cows

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)