Regular Bracket Sequence

题目描述:

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;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值