CodeForces - 612C ：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.

Examples
Input
[<}){}
Output
2
Input
{()}[]
Output
0
Input
]]
Output
Impossible
括号配对问题 - 用栈就可以，注意判断条件
代码如下

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <stack>

using namespace std;

stack<char> st;

int main()
{
    int i,len,ans;
    string s;
    cin >> s;
    len = s.size();
    ans = 0;
    for(i = 0;i < len;i++)
    {
        if(s[i] == '<' || s[i] == '[' || s[i] == '(' || s[i] == '{')
            st.push(s[i]);
        else if(st.size() && st.top() == '<' && s[i] == '>')
            st.pop();
        else if(st.size() && st.top() == '[' && s[i] == ']')
            st.pop();
        else if(st.size() && st.top() == '(' && s[i] == ')')
            st.pop();
        else if(st.size() && st.top() == '{' && s[i] == '}')
            st.pop();
        else if(!st.size() && (s[i] == '>' || s[i] == ']' || s[i] == ')' || s[i] == '}'))
        {
            st.push(s[i]);
            break;
        }
        else
        {
            ans++;
            st.pop();
        }
    }
    if(st.size() != 0)
        printf("Impossible\n");
    else
        printf("%d\n",ans);
}