Educational Codeforces Round 98 (Rated for Div. 2) C. Two Brackets

最新推荐文章于 2024-08-01 11:51:06 发布

我不是手机

最新推荐文章于 2024-08-01 11:51:06 发布

阅读量122

点赞数

分类专栏： cf800--1200

本文链接：https://blog.csdn.net/qq_45891413/article/details/109892653

版权

cf800--1200 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

You are given a string s, consisting of brackets of two types: ‘(’, ‘)’, ‘[’ and ‘]’.

A string is called a regular bracket sequence (RBS) if it’s of one of the following types:

empty string;
‘(’ + RBS + ‘)’;
‘[’ + RBS + ‘]’;
RBS + RBS.
where plus is a concatenation of two strings.

In one move you can choose a non-empty subsequence of the string s (not necessarily consecutive) that is an RBS, remove it from the string and concatenate the remaining parts without changing the order.

What is the maximum number of moves you can perform?

Input
The first line contains a single integer t (1≤t≤1000) — the number of testcases.

Each of the next t lines contains a non-empty string, consisting only of characters ‘(’, ‘)’, ‘[’ and ‘]’. The total length of the strings over all testcases doesn’t exceed 2⋅105.

Output
For each testcase print a single integer — the maximum number of moves you can perform on a given string s.

Example
inputCopy
5
()

([)]
)]([
)[(]
outputCopy
1
2
2
0
1
Note
In the first example you can just erase the whole string.

In the second example you can first erase the brackets on positions 1 and 2: “”, then “()” is left. After that you can erase it whole. You could erase the whole string from the beginning but you would get one move instead of two.

In the third example you can first erase the brackets on positions 1 and 3: “([)]”. They form an RBS “()”. Then “[]” is left, so you can erase it whole.

In the fourth example there is no subsequence that is an RBS, so you can’t perform a move at all.

In the fifth example you can erase the brackets on positions 2 and 4: “)[(]” and get “)(” as a result. You can erase nothing from it.
左右括号去匹配

#include<map>
#include<stack>
#include<queue>
#include<string>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define pb push_back
//#include<bits/stdc++.h>
using namespace std;
const int P=1e9+5;
const int mod=1e9+7;
const int maxn=1e6+5;
typedef long long ll;
const int inf=0x3f3f3f3f;
int t,len,cnt1,cnt3,flag1,flag2;
string s;
int main()
{
    cin>>t;
    while(t--)
    {
        cin>>s;
        len = s.length();
        cnt1 = 0;
        cnt3 = 0;
        flag1 = 0;
        flag2 = 0;
        for(int i=0;i<len;i++)
        {
            if(s[i] == ')' && flag2 !=0)
            {
                cnt1++;
                flag2 --;
            }
            if(s[i]=='(' )
                flag2 ++;
            if(s[i] == ']' && flag1 != 0)
            {
                cnt3++;
                flag1--;
            }
            if(s[i] == '[' )
                flag1++;
        }
        cout<<cnt1+cnt3<<endl;
    }
}