题目描述:
A bracket sequence is called regular if it is possible to obtain correct arithmetic expression by inserting characters «+» and «1» into this sequence. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not。One day Johnny got bracket sequence. He decided to remove some of the brackets from it in order to obtain a regular bracket sequence. What is the maximum length of a regular bracket sequence which can be obtained?
输入格式:
Input consists of a single line with non-empty string of «(» and «)» characters. Its length does not exceed106.
输出格式:
Output the maximum possible length of a regular bracket sequence.
样例输入: (()))(
样例输出: 4
这道题一看就是用栈做的,碰到一个左括号则将此符号推入栈中,当遇到右括号时,需要判断栈是否为空,若不为空,则弹出栈顶,答案+2.
代码如下:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int maxn=1e6+10;
int read(){
int x=0,f=1;char ch=getchar();
while (ch<'0' || ch>'9'){if (ch=='-')f=-1;ch=getchar();}
while ('0'<=ch && ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*f;
}
stack<char> s;
string a;
int ans=0;
int main()
{
cin>>a;
for (int i=0;i<a.size();i++)
if (a[i]=='(')
s.push(a[i]);
else
if (!s.empty())
s.pop(),ans+=2;
cout<<ans;
return 0;
}