UVa442 矩阵链乘 栈 stack

#include <iostream>
#include <stack>
#include <string>

using namespace std;

struct Matrix {
    int a, b;
    Matrix(int a=0, int b=0):a(a),b(b){}
}m[26];

stack<Matrix> s;      //声明一个栈

int main(){
    int n;
    cin >> n;
    for(int i = 0; i < n; i++){
        string name;
        cin >> name;
        int k = name[0] - 'A';
        cin >> m[k].a >> m[k].b;
    }
    string expr;
    while(cin >> expr){
        int len = expr.length();
        bool error = false;
        int ans = 0;
        for(int i = 0; i < len; i++){
            if(isalpha(expr[i])) s.push(m[expr[i] - 'A']);   //入栈
            else if(expr[i] == ')'){
                Matrix m2 = s.top(); s.pop();<span style="white-space:pre">		</span>//出栈
                Matrix m1 = s.top(); s.pop();
                if(m1.b != m2.a) {error = true; break;}
                ans += m1.a * m1.b * m2.b;
                s.push(Matrix(m1.a, m2.b));
            }
        }
        if(error)
            cout<<expr<<" is error"<<endl;
        else
            cout<<expr<<" = "<<ans<<endl;
    }
return 0;
}