【Codeforces 612c】

Description
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.

Sample Input
Input
[<}){}
Output
2
Input
{()}[]
Output
0
Input
]]

一道基础的栈题：
题解：也是一道栈题，如果遇到 “<”,”[“,”{“,”(“,就储存到栈里，遇到>,},],),就判断理他最近的左括号是不是相匹配的，不是就要变，然后出要栈；如果没有左括号也就是为空栈就要输出 “Impossible”；

#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;
char s[1000000+11];
int n;
int main()
{
    stack < int > sta;
    int i,l,k,sum;
    while(scanf("%s",s)!=EOF)
    {
        l=strlen(s);
        k=1;sum=0;
        for(i=0;i<l;i++)
        {
            if(s[i]=='{'||s[i]=='<'||s[i]=='('||s[i]=='[')
            sta.push(s[i]);
            else
            {
                if(sta.empty())
                {
                k=0;
                break;
                }
                else
                {
                    if(s[i]=='>')
                    {
                        if(sta.top()!='<')
                        sum++;
                    }
                    else if(s[i]=='}')
                    {
                        if(sta.top()!='{')
                        sum++;
                    }
                    else if(s[i]==')')
                    {
                        if(sta.top()!='(')
                        sum++;
                    }
                    else if(s[i]==']')
                    {
                        if(sta.top()!='[')
                        sum++;
                    }
                    sta.pop();
                }
            }
        }
        if(!sta.empty()||k==0)
        printf("Impossible\n");
        else
        printf("%d\n",sum);
    }
    return 0;
}