Uva 442 Matrix Chain Multiplication 栈

/*
用栈，每次遇到右括号就把从左括号到右括号之间的部分全部计算。要在读取字符串的时候左边加一个左括号，
右边加一个右括号。
*/
#include<cstdio>
#include<stack>
#include<cstring>
#include<string>
#include<iostream>
using namespace std;

struct Type
{
    char a;
    int r,c;
};

Type matrix[30];
stack<Type> s;
string exp;

int main()
{
    int n,i;
    //freopen("in.txt","r",stdin);
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        getchar();//吃掉‘\n’
        scanf("%c %d %d",&matrix[i].a, &matrix[i].r, &matrix[i].c);
    }
    while(cin>>exp)
    {
        stack<Type> s;
        int len = exp.size();
        long long ans = 0;
        bool flag = true;
        for(i=0;i<len; i++)
        {
            if(exp[i] == '(') continue;
            if(exp[i] == ')')
            {
                //union
                Type t1, t2;
                if( s.empty()) {flag = false; break;} t2 = s.top();s.pop();
                if( s.empty()) {flag = false; break;} t1= s.top();s.pop();
                //printf("%c %d %d\n",t1.a, t1.r, t1.c);
                //printf("%c %d %d\n",t2.a, t2.r, t2.c);
                if(t1.c !=t2.r){flag = false; break;}
                ans +=t1.r*t1.c*t2.c;
                t1.c =t2.c;
                s.push(t1);

            }
            else
            {
                int k;
                for(k=0; k<n; k++) if(matrix[k].a == exp[i]) break;
                s.push(matrix[k]);
            }
        }
        if(flag) printf("%lld\n",ans);
        else printf("error\n");
    }
    return 0;
}