1/20集训一 STL A.(括号配对，栈）Replace To Make Regular Bracket Sequence

1/20 集训一 STL

A.(括号配对，栈）Replace To Make Regular Bracket Sequence

You are given string s consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same type. For example, you can replace < by the bracket {, but you can’t replace it by ) or >.

The following definition of a regular bracket sequence is well-known, so you can be familiar with it.

Let’s define a regular bracket sequence (RBS). Empty string is RBS. Let s1 and s2 be a RBS then the strings s2, {s1}s2, [s1]s2, (s1)s2 are also RBS.

For example the string “[[(){}]<>]” is RBS, but the strings “[)()” and “][()()” are not.

Determine the least number of replaces to make the string s RBS.

Input
The only line contains a non empty string s, consisting of only opening and closing brackets of four kinds. The length of s does not exceed 106.

Output
If it’s impossible to get RBS from s print Impossible.

Otherwise print the least number of replaces needed to get RBS from s.

Example
Input
[<}){}
Output
2
Input
{()}[]
Output
0
Input
]]
Output
Impossible

题意：
要看括号是否匹配，若可以匹配，则输出需要更改括号形式的次数。否则输出impossible。

思路：
1、若出现左括号，则进栈；
2、若出现右括号：
①首先检查栈是否空，若栈为空，那么这个右括号多余，退出循环
②否则将这个右括号和栈顶元素比较， 若二者匹配，则左括号出栈，若不匹配，则说明需要将这个括号更换形式，使ans++，并使左括号出栈。
3、当循环结束时，如果左右括号的数量不相等则说明不能完全匹配。
4、检查flag的值，输出结果。

#include <iostream>
#include <stack>
#include <string.h>
#include <stdio.h>
#define MAXN 1000005

using namespace std;

char arr[MAXN];

int main()
{
    stack<char> a;
    scanf("%s", arr);
    int left = 0, right = 0, ans = 0, flag = 1, len;
    len = strlen(arr);
    for(int i = 0; i < len; i++)
    {
        if(arr[i] == '{' || arr[i] == '(' || arr[i] == '<' || arr[i] == '[')
        {
            left++;
            a.push(arr[i]);
        }
        else if(arr[i] == '}')
        {
            right++;
            if(a.empty())
            {
                flag = 0;
                break;
            }
            else if(a.top() == '{')
            {
                a.pop();
            }
            else
            {
                ans++;
                a.pop();
            }
        }
        else if(arr[i] == ')')
        {
            right++;
            if(a.empty())
            {
                flag = 0;
                break;
            }
            else if(a.top() == '(')
            {
                a.pop();
            }
            else
            {
                ans++;
                a.pop();
            }
        }
        else if(arr[i] == '>')
        {
            right++;
            if(a.empty())
            {
                flag = 0;
                break;
            }
            else if(a.top() == '<')
            {
                a.pop();
            }
            else
            {
                ans++;
                a.pop();
            }
        }
        else if(arr[i] == ']')
        {
            right++;
            if(a.empty())
            {
                flag = 0;
                break;
            }
            else if(a.top() == '[')
            {
                a.pop();
            }
            else
            {
                ans++;
                a.pop();
            }
        }
    }
    if(left != right)
        flag = 0;
    if(flag)
        cout<<ans<<endl;
    else
        cout<<"Impossible"<<endl;
    return 0;
}